Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs

DOI10.1016/j.disopt.2008.08.002zbMath1162.05328OpenAlexW2054847415MaRDI QIDQ1013291

Toshimasa Ishii

Publication date: 17 April 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://barrel.repo.nii.ac.jp/?action=repository_action_common_download&item_id=2496&item_no=1&attribute_id=19&file_no=1

zbMATH Keywords

undirected graphconnectivity augmentation problempolynomial time deterministic algorithmmonotone requirement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Connectivity (05C40)

Related Items (1)

Augmenting edge-connectivity between vertex subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Graph connectivity and its augmentation: Applications of MA orderings
• Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
• Edge-connectivity augmentation problems
• Covering symmetric supermodular functions by graphs
• Efficient splitting off algorithms for graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• 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)
• Minimum Degree Orderings

This page was built for publication: Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs