Effective edge-fault-tolerant single-source spanners via best (or good) swap edges

DOI10.1007/978-3-319-72050-0_18zbMath1390.68494arXiv1707.08861OpenAlexW2740483114MaRDI QIDQ1742786

Guido Proietti, Luciano Gualà, Stefano Leucci, Davide Bilò, Feliciano Colella

Publication date: 12 April 2018

Full work available at URL: https://arxiv.org/abs/1707.08861

zbMATH Keywords

swap algorithmsedge-fault-tolerant spannersingle-source shortest-path tree

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)

Related Items (3)

An improved algorithm for computing all the best swap edges of a tree spanner ⋮ A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners ⋮ An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

This page was built for publication: Effective edge-fault-tolerant single-source spanners via best (or good) swap edges