The bridge-connectivity augmentation problem with a partition constraint
From MaRDI portal
Publication:982661
DOI10.1016/j.tcs.2010.04.019zbMath1192.68477OpenAlexW2090931551MaRDI QIDQ982661
Yen-Chiu Chen, Hsin-Wen Wei, Pei-Chi Huang, Wei-Kuan Shih, Tsan-sheng Hsu
Publication date: 7 July 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.019
Related Items (2)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Listing all spanning trees in Halin graphs — sequential and Parallel view
Cites Work
- Unnamed Item
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- Smallest bipartite bridge-connectivity augmentation
- A minimum 3-connectivity augmentation of a graph
- Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
- An Efficient Parallel Biconnectivity Algorithm
- A Graph Theoretic Approach to Statistical Data Security
- Suppression Methodology and Statistical Disclosure Control
- Auditing and Inference Control in Statistical Databases
- 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
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- On Four-Connecting a Triconnected Graph
- 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: The bridge-connectivity augmentation problem with a partition constraint
