Distributed Computing - IWDC 2004

DOI10.1007/B104419MaRDI QIDQ5465899zbMATH OpenOpenAlexFDO

Authors L. Pagli, Tranos Zuva, G. Prencipe

Publication date 12 August 2005

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

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

zbMATH Keywords

Data ComplexityDistributed AlgorithmsFault-Tolerant RoutingPoint of Failure ReroutingShortest Path Spanning TreeWeighted Graphs

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Linear time distributed swap edge algorithms
• Linear time distributed swap edge algorithms
• Task swapping networks in distributed systems
• scientific article; zbMATH DE number 719724
• Distributed computation in dynamic networks
• Distributed edge connectivity in sublinear time
• Computing all the best swap edges distributively
• Principles of Distributed Systems

Cited in

(6)

• Task swapping networks in distributed systems
• Computing all the best swap edges distributively
• scientific article; zbMATH DE number 2163017 (Why is no real title available?)
• Linear time distributed swap edge algorithms
• scientific article; zbMATH DE number 1405681 (Why is no real title available?)
• Linear time distributed swap edge algorithms

This page was built for publication: Distributed Computing - IWDC 2004

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