GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)

DOI10.15807/jorsj.47.199zbMath1106.05091OpenAlexW411977278MaRDI QIDQ4671019

Hiroshi Nagamochi

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.199

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Minimum cost subpartitions in graphs ⋮ Minimum degree orderings ⋮ Sparse connectivity certificates via MA orderings in graphs ⋮ Static and dynamic source locations in undirected networks ⋮ Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks ⋮ Augmenting edge-connectivity between vertex subsets ⋮ Posimodular function optimization ⋮ Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs

This page was built for publication: GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)