A simple test on 2-vertex- and 2-edge-connectivity
From MaRDI portal
Publication:1943645
DOI10.1016/j.ipl.2013.01.016zbMath1259.05173arXiv1209.0700OpenAlexW2085571958WikidataQ56485279 ScholiaQ56485279MaRDI QIDQ1943645
Publication date: 20 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.0700
Related Items (29)
König graphs for 3-paths and 3-cycles ⋮ Optimal In-place Algorithms for Basic Graph Problems ⋮ Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ Criterion for a graph to admit a good orientation in terms of leaf blocks ⋮ Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem ⋮ A branch-and-cut algorithm for the minimum branch vertices spanning tree problem ⋮ Optimizing adiabatic quantum program compilation using a graph-theoretic framework ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ Computing Tutte Paths ⋮ Distributed computations in fully-defective networks ⋮ A genetic approach for the 2‐edge‐connected minimum branch vertices problem ⋮ A simple certifying algorithm for 3-edge-connectivity ⋮ A positivity phenomenon in Elser's Gaussian-cluster percolation model ⋮ Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ Edge-orders ⋮ Certifying 3-edge-connectivity ⋮ An exact and heuristic approach for the \(d\)-minimum branch vertices problem ⋮ Unnamed Item ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Algebraic Bayesian networks: checking backbone connectivity ⋮ Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster ⋮ Improved Space Efficient Algorithms for BFS, DFS and Applications ⋮ Computing Giant Graph Diameters ⋮ Space efficient linear time algorithms for BFS, DFS and applications ⋮ Computing 2-twinless blocks ⋮ The Price of Connectivity in Fair Division ⋮ Bridges in the random-cluster model
This page was built for publication: A simple test on 2-vertex- and 2-edge-connectivity
