Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
From MaRDI portal
Publication:3419712
DOI10.1002/jgt.20180zbMath1108.05066MaRDI QIDQ3419712
Endre Boros, Khaled M. Elbassioni, Vladimir A. Gurvich
Publication date: 7 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20180
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Related Items
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, Matching interdiction, Enumerating minimal dominating sets in chordal bipartite graphs, Generating cut conjunctions in graphs and related problems, Blockers and transversals, Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
Cites Work