ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

DOI10.15807/JORSJ.50.325MaRDI QIDQ5385037zbMATH OpenOpenAlexFDO

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

Publication date 29 April 2008

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.50.325

zbMATH Keywords

algorithmenumerationmatroidquasi-polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Enumerating Spanning and Connected Subsets in Graphs and Matroids
• On the Complexity of Some Enumeration Problems for Matroids
• Algorithms and Computation
• Generating 3-vertex connected spanning subgraphs
• Algorithms and Computation

Cited in

(6)

• Unranking of small combinations from large sets
• Algorithms and Computation
• Enumerating Spanning and Connected Subsets in Graphs and Matroids
• Algorithms and Computation
• 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(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

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