Algorithms and Computation
From MaRDI portal
Publication:5897849
DOI10.1007/11602613zbMath1147.68609OpenAlexW2304246803MaRDI QIDQ5897849
Konrad Borys, Khaled M. Elbassioni, Kazuhisa Makino, Vladimir A. Gurvich, Endre Boros, Leonid G. Khachiyan
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Scientific contributions of Leo Khachiyan (a short overview) ⋮ Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties ⋮ Generating 3-vertex connected spanning subgraphs ⋮ Listing minimal edge-covers of intersecting families with applications to connectivity problems
