Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
From MaRDI portal
Publication:3639242
DOI10.1007/978-3-642-04128-0_13zbMath1256.68150OpenAlexW1569588123MaRDI QIDQ3639242
Imran Rauf, Kazuhisa Makino, Khaled M. Elbassioni
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://edoc.mpg.de/518247
Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Proximity Search for Maximal Subgraph Enumeration ⋮ Minimal dominating sets in interval graphs and trees ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices
This page was built for publication: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs