Searching for "Exact algorithms for finding minimum transversals in rank-3 hypergraphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Exact Algorithms for Finding Minimum Transversals in Rank-3 Hypergraphs
by Magnus Wahlström — 2003
…Exact algorithms for finding minimum transversals in rank-3 hypergraphs Magnus Wahlstrom 1…
Cited by 4 (0 self) – Add To MetaCart

Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems
by Magnus Wahlström — 2007 — Department of Computer
…–543. 2002. – Magnus Wahlström. Exact algorithms for finding minimum transversals in rank-3 hypergraphs…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB