Generating Minimal k-Vertex Connected Spanning Subgraphs

DOI10.1007/978-3-540-73545-8_23zbMath1206.05094OpenAlexW1604664006MaRDI QIDQ3608847

Endre Boros, Gábor Rudolf, Konrad Borys, Kazuhisa Makino, Khaled M. Elbassioni, Vladimir A. Gurvich

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (5)

Enumeration of support-closed subsets in confluent systems ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Generating 3-vertex connected spanning subgraphs ⋮ Listing minimal edge-covers of intersecting families with applications to connectivity problems

This page was built for publication: Generating Minimal k-Vertex Connected Spanning Subgraphs