Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
type: Item
instance of: scholarly article
title: Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
zbMATH Open document ID: 1187.05042
author: Toshimasa Ishii
author: Yoko Akiyama
author: Hiroshi Nagamochi
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
full work available at URL: http://hdl.handle.net/10252/3049
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5674255
zbMATH Keywords: undirected graph
zbMATH Keywords: connectivity augmentation problem
zbMATH Keywords: edge-connectivity
zbMATH Keywords: node-to-area connectivity
zbMATH Keywords: polynomial time deterministic algorithm
zbMATH Keywords: edge-splitting
MaRDI profile type: Publication
OpenAlex ID: W1972636981
cites work: Locating sources to meet flow demands in undirected networks
cites work: Covering symmetric supermodular functions by graphs
cites work: Edge-Connectivity Augmentation with Partition Constraints
cites work: Q4198056
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: Q4845372
cites work: Q4664045
cites work: Edge connectivity between nodes and node-subsets
cites work: An Analytical Solution of Vector Diffraction for Focusing Optical Systems
cites work: Data Security Equals Graph Connectivity
cites work: NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
cites work: Minimum cost source location problem with vertex-connectivity requirements in digraphs
cites work: Approximating connectivity augmentation problems
cites work: Edge-connectivity augmentation problems
DOI: 10.1007/S00453-008-9178-Y
description: scientific article; zbMATH DE number 5674255