Sciweavers

Share
ESA
2006
Springer

Enumerating Spanning and Connected Subsets in Graphs and Matroids

10 years 2 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus can be solved in incremental quasi-polynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected edge subsets of a given graph can be generated in incremental polynomial time.
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where ESA
Authors Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Comments (0)
books