Generating 3-vertex connected spanning subgraphs
From MaRDI portal
Publication:998366
DOI10.1016/j.disc.2007.11.067zbMath1157.05048OpenAlexW2046655131MaRDI QIDQ998366
Endre Boros, Konrad Borys, Vladimir A. Gurvich, 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
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- On generating all maximal independent sets
- On enumerating all minimal solutions of feedback problems
- A flexible algorithm for generating all the spanning trees in undirected graphs
- Generating Minimal k-Vertex Connected Spanning Subgraphs
- The Complexity of Enumeration and Reliability Problems
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Finding All Spanning Trees of Directed and Undirected Graphs
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Dividing a Graph into Triconnected Components
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- Integer Programming and Combinatorial Optimization
- Algorithms and Computation
This page was built for publication: Generating 3-vertex connected spanning subgraphs
