Optimal augmentation for bipartite componentwise biconnectivity in linear time
From MaRDI portal
Recommendations
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
- Smallest bipartite bridge-connectivity augmentation
- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
- Finding a Smallest Augmentation to Biconnect a Graph
- scientific article; zbMATH DE number 1303570
Cites work
- A Graph Theoretic Approach to Statistical Data Security
- A minimum 3-connectivity augmentation of a graph
- Augmentation Problems
- Data Security Equals Graph Connectivity
- Finding a Smallest Augmentation to Biconnect a Graph
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1256642 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
- Minimum block containing a given graph
- Optimal Mixed Graph Augmentation
- Smallest Augmentations to Biconnect a Graph
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
Cited in
(4)
This page was built for publication: Optimal augmentation for bipartite componentwise biconnectivity in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487441)
