Algorithms and Computation

DOI10.1007/B104582zbMath1116.05316OpenAlexW2491382297MaRDI QIDQ5712107

Davide Bilò, Guido Proietti

Publication date: 22 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104582

zbMATH Keywords

NP-hardnessGraph AlgorithmsEdge-Connectivity AugmentationNetwork SurvivabilitySpider Tress

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) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

This page was built for publication: Algorithms and Computation