Pages that link to "Item:Q3639242"
From MaRDI portal
The following pages link to Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs (Q3639242):
Displaying 6 items.
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)