scientific article
From MaRDI portal
Publication:2843925
zbMath1270.05093MaRDI QIDQ2843925
Yoko Akiyama, Hiroshi Nagamochi, Toshimasa Ishii
Publication date: 27 August 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104810168
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (3)
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs ⋮ Minimum cost source location problem with local 3-vertex-connectivity requirements ⋮ The source location problem with local 3-vertex-connectivity requirements
This page was built for publication:
