Generating Minimal k-Vertex Connected Spanning Subgraphs
DOI10.1007/978-3-540-73545-8_23zbMATH Open1206.05094OpenAlexW1604664006MaRDI QIDQ3608847FDOQ3608847
Khaled Elbassioni, Endre Boros, Gábor Rudolf, Vladimir Gurvich, Konrad Borys, Kazuhisa Makino
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
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 ALL THE MINIMAL SEPARATORS OF A GRAPH
- Generating 3-vertex connected spanning subgraphs
- Enumeration of support-closed subsets in confluent systems
- 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)
