Enumerating Spanning and Connected Subsets in Graphs and Matroids

DOI10.1007/11841036_41zbMath1131.05305OpenAlexW2115074797MaRDI QIDQ5449549

Kazuhisa Makino, Konrad Borys, Endre Boros, Vladimir A. Gurvich, Khaled M. Elbassioni, Leonid G. Khachiyan

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_41

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (7)

Enumeration of support-closed subsets in confluent systems ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Quantum algorithms for learning hidden strings with applications to matroid problems ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Unnamed Item ⋮ Generating 3-vertex connected spanning subgraphs

This page was built for publication: Enumerating Spanning and Connected Subsets in Graphs and Matroids