Smallest bipartite bridge-connectivity augmentation

DOI10.1007/S00453-007-9127-1zbMATH Open1187.68345OpenAlexW1979844788MaRDI QIDQ834588FDOQ834588

Authors: Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu 

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

Recommendations

• Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
• Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
• Optimal augmentation for bipartite componentwise biconnectivity in linear time
• The bridge-connectivity augmentation problem with a partition constraint
• Finding a Smallest Augmentation to Biconnect a Graph

zbMATH Keywords

data security2-edge-connectivitybipartite graph augmentationbridge-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
• An Efficient Parallel Biconnectivity Algorithm
• Finding a Smallest Augmentation to Biconnect a Graph
• Augmentation Problems
• A Graph Theoretic Approach to Statistical Data Security
• Cell suppression: Disclosure protection for sensitive tabular data
• On Four-Connecting a Triconnected Graph
• Edge-Connectivity Augmentation with Partition Constraints
• Suppression Methodology and Statistical Disclosure Control
• Smallest Augmentations to Biconnect a Graph
• Simpler and faster biconnectivity augmentation
• A minimum 3-connectivity augmentation of a graph
• Data Security Equals Graph Connectivity
• Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
• Title not available (Why is that?)
• Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• An Analytical Solution of Vector Diffraction for Focusing Optical Systems
• Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

Cited In (5)

• The bridge-connectivity augmentation problem with a partition constraint
• Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
• Optimal augmentation for bipartite componentwise biconnectivity in linear time
• Optimal Mixed Graph Augmentation
• Title not available (Why is that?)

This page was built for publication: Smallest bipartite bridge-connectivity augmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834588)