Single backup table schemes for shortest-path routing

DOI10.1016/j.tcs.2004.06.033zbMath1070.68149OpenAlexW2020619470MaRDI QIDQ1770371

Yasuo Okabe, Hiro Ito, Takuya Yoshihiro, Kazuo Iwama

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.033

zbMATH Keywords

RoutingFault toleranceGraph algorithmsShortest pathsBackup tablesSwap edges

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Faster swap edge computation in minimum diameter spanning trees ⋮ Computing all the best swap edges distributively ⋮ Faster Swap Edge Computation in Minimum Diameter Spanning Trees ⋮ An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

Cites Work

• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Swapping a failing edge of a single source shortest paths tree is good and fast
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Fully dynamic shortest paths in digraphs with arbitrary arc weights

This page was built for publication: Single backup table schemes for shortest-path routing