On rooted node-connectivity problems

DOI10.1007/s00453-001-0017-7zbMath0983.68147OpenAlexW2037328176MaRDI QIDQ5945916

Tibor Jordán, Joseph Cheriyan, Zeev Nutov

Publication date: 14 October 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0017-7

zbMATH Keywords

graph connectivitymetric costsuniform costs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (4)

On extremal \(k\)-outconnected graphs ⋮ Property testing on \(k\)-vertex-connectivity of graphs ⋮ On shredders and vertex connectivity augmentation ⋮ On minimum power connectivity problems

This page was built for publication: On rooted node-connectivity problems