Enumerating Spanning and Connected Subsets in Graphs and Matroids

DOI10.1007/11841036_41MaRDI QIDQ5449549zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• On the Complexity of Some Enumeration Problems for Matroids
• Algorithms and Computation
• Algorithms and Computation
• Generating 3-vertex connected spanning subgraphs

Cited in

(15)

• Listing minimal edge-covers of intersecting families with applications to connectivity problems
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
• Enumeration of support-closed subsets in confluent systems
• Enumeration of connected graph coverings
• scientific article; zbMATH DE number 1405693 (Why is no real title available?)
• scientific article; zbMATH DE number 7559431 (Why is no real title available?)
• Algorithms and Computation
• ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Algorithms and Computation
• Polynomial-delay and polynomial-space enumeration of large maximal matchings
• Quantum algorithms for learning hidden strings with applications to matroid problems
• Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
• Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
• Scientific contributions of Leo Khachiyan (a short overview)
• Generating 3-vertex connected spanning subgraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449549)