Robust Recoverable Path Using Backup Nodes
DOI10.1007/978-3-662-49192-8_8zbMath1428.68043WikidataQ59567413 ScholiaQ59567413MaRDI QIDQ2794347
Hoogeveen, J. A., Hans L. Bodlaender, Thomas C. van Dijk, Marjan van den Akker, Erik van Ommeren
Publication date: 10 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/328199
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M15: Reliability, testing and fault tolerance of networks and computer systems
