Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
DOI10.1007/S00453-008-9178-YzbMATH Open1187.05042OpenAlexW1972636981MaRDI QIDQ848841FDOQ848841
Yoko Akiyama, Toshimasa Ishii, Hiroshi Nagamochi
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10252/3049
undirected graphedge-connectivityedge-splittingconnectivity augmentation problemnode-to-area connectivitypolynomial time deterministic algorithm
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Locating sources to meet flow demands in undirected networks
- Edge-Connectivity Augmentation with Partition Constraints
- Edge connectivity between nodes and node-subsets
- Edge-connectivity augmentation problems
- Covering symmetric supermodular functions by graphs
- NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Approximating connectivity augmentation problems
- Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
- Data Security Equals Graph Connectivity
- An Analytical Solution of Vector Diffraction for Focusing Optical Systems
Cited In (7)
- \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
- Augmenting edge-connectivity between vertex subsets
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem
- Title not available (Why is that?)
- The minimum augmentation of any graph to aK-edge-connected graph
- The Minset-Poset Approach to Representations of Graph Connectivity
- On the minimum local-vertex-connectivity augmentation in graphs
This page was built for publication: Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848841)
