A new algorithm for the hypergraph transversal problem

Leonid Khachiyan, Endre Boros, Khaled Elbassioni, Vladimir Gurvich

Research output: Contribution to journalConference articlepeer-review

17 Scopus citations


We consider the problem of finding all minimal transversals of a hypergraph ℋ ⊆ 2V, given by an explicit list of its hyperedges. We give a new decomposition technique for solving the problem with the following advantages: (i) Global parallelism: for certain classes of hypergraphs, e.g. hypergraphs of bounded edge size, and any given integer k, the algorithm outputs k minimal transversals of ℋ in time bounded by polylog(|V|, |ℋ|, k) assuming poly(|V|, |ℋ|, k) number of processors. Except for the case of graphs, none of the previously known algorithms for solving the same problem exhibit this feature, (ii) Using this technique, we also obtain new results on the complexity of generating minimal transversals for new classes of hypergraphs, namely hypergraphs of bounded dual-conformality, and hypergraphs in which every edge intersects every minimal transversal in a bounded number of vertices.

Original languageBritish English
Pages (from-to)767-776
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - 2005
Event11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China
Duration: 16 Aug 200529 Aug 2005


Dive into the research topics of 'A new algorithm for the hypergraph transversal problem'. Together they form a unique fingerprint.

Cite this