Finding a Smallest Augmentation to Biconnect a Graph
From MaRDI portal
Recommendations
- Simpler and faster biconnectivity augmentation
- Simpler sequential and parallel biconnectivity augmentation in trees
- A unifying augmentation algorithm for two-edge connectivity and biconnectivity
- On Finding Minimal Two-Connected Subgraphs
- Optimal augmentation for bipartite componentwise biconnectivity in linear time
Cited in
(17)- A unifying augmentation algorithm for two-edge connectivity and biconnectivity
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Tri-connectivity augmentation in trees
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- Simpler sequential and parallel biconnectivity augmentation in trees
- Triangulating planar graphs while minimizing the maximum degree
- 5-shredders of contraction-critical 5-connected graphs
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
- Optimal augmentation for bipartite componentwise biconnectivity in linear time
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
- Augmenting the edge connectivity of planar straight line graphs to three
- Graph connectivity and its augmentation: Applications of MA orderings
- How to allocate review tasks for robust ranking
- Smallest bipartite bridge-connectivity augmentation
- The bridge-connectivity augmentation problem with a partition constraint
This page was built for publication: Finding a Smallest Augmentation to Biconnect a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142584)
