A simple certifying algorithm for 3-edge-connectivity
From MaRDI portal
Publication:2689444
DOI10.1016/j.tcs.2023.113760OpenAlexW4286796610MaRDI QIDQ2689444
Publication date: 10 March 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.04727
depth-first searchcertificatecertifying algorithm3-edge-connected graph3-edge-connected componentcactus representation of cut-pairgraph recognition algorithmMader construction sequence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Path-based depth-first search for strong and biconnected components
- Certifying algorithms
- Certifying 3-edge-connectivity
- A simple 3-edge-connected component algorithm
- Yet another optimal algorithm for 3-edge-connectivity
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- A simple test on 2-vertex- and 2-edge-connectivity
- A simple 3-edge connected component algorithm revisited
- An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs
- Algorithms for placing monitors in a flow network
- Contractions, Removals, and Certifying 3-Connectivity in Linear Time
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
- PERFECT STOCHASTIC SUMMATION IN HIGH ORDER FEYNMAN GRAPH EXPANSIONS
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- The Cluster Editing Problem: Implementations and Experiments
- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
- Algorithmic Aspects of Graph Connectivity
- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: A simple certifying algorithm for 3-edge-connectivity
