Generating Minimal k-Vertex Connected Spanning Subgraphs

DOI10.1007/978-3-540-73545-8_23MaRDI QIDQ3608847zbMATH OpenOpenAlexFDO

Authors Endre Boros, Konrad Borys, Kazuhisa Makino, Gábor Rudolf, Khaled Elbassioni, Vladimir 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

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

Cited in

(6)

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

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

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