scientific article; zbMATH DE number 2163017

MaRDI QIDQ4673402zbMATH OpenFDO

Authors Antonio Mesa Enriques, L. Pagli, P. Flocchini, G. Prencipe, N. Santoro

Publication date 29 April 2005

zbMATH Keywords

distributed algorithmsweighted graphsdata complexityfault-tolerant routingpoint of failure reroutingshortest path spanning tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed algorithms (68W15) Network protocols (68M12)

Recommendations

• Computing all the best swap edges distributively
• Distributed Computing - IWDC 2004
• Principles of Distributed Systems
• Swapping a failing edge of a single source shortest paths tree is good and fast
• Linear time distributed swap edge algorithms

Cited in

(7)

• Structural Information and Communication Complexity
• Computing all the best swap edges distributively
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
• Linear time distributed swap edge algorithms
• An improved algorithm for computing all the best swap edges of a tree spanner
• Computing Best Swaps in Optimal Tree Spanners
• A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673402)