Augmenting edge-connectivity between vertex subsets
From MaRDI portal
Publication:472470
DOI10.1007/s00453-012-9724-5zbMath1303.05100OpenAlexW2044052083MaRDI QIDQ472470
Toshimasa Ishii, Kazuhisa Makino
Publication date: 19 November 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9724-5
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph connectivity and its augmentation: Applications of MA orderings
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Tight approximation algorithm for connectivity augmentation problems
- Edge-connectivity augmentation of graphs over symmetric parity families
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
- Edge-connectivity augmentation problems
- Covering symmetric supermodular functions by graphs
- An analysis of the greedy algorithm for the submodular set covering problem
- Efficient splitting off algorithms for graphs
- Edge-Connectivity Augmentations of Graphs and Hypergraphs
- A New Approach to Splitting-Off
- Minimum Transversals in Posimodular Systems
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
