Smallest bipartite bridge-connectivity augmentation
From MaRDI portal
Publication:834588
DOI10.1007/s00453-007-9127-1zbMath1187.68345OpenAlexW1979844788MaRDI QIDQ834588
Wei-Kuan Shih, Wan-Chen Lu, Tsan-sheng Hsu, Pei-Chi Huang, Hsin-Wen Wei
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9127-1
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- A minimum 3-connectivity augmentation of a graph
- Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
- Finding a Smallest Augmentation to Biconnect a Graph
- An Efficient Parallel Biconnectivity Algorithm
- A Graph Theoretic Approach to Statistical Data Security
- Suppression Methodology and Statistical Disclosure Control
- Cell suppression: Disclosure protection for sensitive tabular data
- Augmentation Problems
- Smallest Augmentations to Biconnect a Graph
- Edge-Connectivity Augmentation with Partition Constraints
- Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
- Concurrent threads and optimal parallel minimum spanning trees algorithm
- On Four-Connecting a Triconnected Graph
- An Analytical Solution of Vector Diffraction for Focusing Optical Systems
- Simpler and faster biconnectivity augmentation
- Data Security Equals Graph Connectivity
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Smallest bipartite bridge-connectivity augmentation
