Generating 3-vertex connected spanning subgraphs

DOI10.1016/J.DISC.2007.11.067zbMATH Open1157.05048OpenAlexW2046655131MaRDI QIDQ998366FDOQ998366

Vladimir Gurvich, Endre Boros, Konrad Borys, Gábor Rudolf

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.067

Recommendations

• On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs
• A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
• scientific article; zbMATH DE number 742959
• ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Enumerating Spanning and Connected Subsets in Graphs and Matroids

zbMATH Keywords

enumerationgenerationlisting3-vertex connected spanning subgraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• The Complexity of Enumeration and Reliability Problems
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Title not available (Why is that?)
• Finding All Spanning Trees of Directed and Undirected Graphs
• On generating all maximal independent sets
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Dividing a Graph into Triconnected Components
• On enumerating all minimal solutions of feedback problems
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• A flexible algorithm for generating all the spanning trees in undirected graphs
• Integer Programming and Combinatorial Optimization
• Generating Minimal k-Vertex Connected Spanning Subgraphs
• Enumerating Spanning and Connected Subsets in Graphs and Matroids
• Algorithms and Computation

Cited In (1)

• Spanning even subgraphs of 3‐edge‐connected graphs

This page was built for publication: Generating 3-vertex connected spanning subgraphs

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