NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)

DOI10.15807/jorsj.47.224zbMath1134.05324OpenAlexW360997707MaRDI QIDQ4671020

Hiroyoshi Miwa, Hiro Ito

Publication date: 23 April 2005

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.47.224

zbMATH Keywords

algorithmgraph theoryCombinatorial optimizationconnectivity augmentation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (5)

Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ⋮ The Generalized Terminal Backup Problem ⋮ A New Approach to Splitting-Off ⋮ Augmenting edge-connectivity between vertex subsets ⋮ Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs

This page was built for publication: NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)