Distributed Computing - IWDC 2004

DOI10.1007/B104419zbMATH Open1113.68338OpenAlexW2917234383MaRDI QIDQ5465899

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

Distributed AlgorithmsData ComplexityFault-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)

Related Items (2)

Linear time distributed swap edge algorithms ⋮ Task swapping networks in distributed systems

Recommendations

• Title not available (Why is that?) 👍 👎
• Computing all the best swap edges distributively 👍 👎
• Linear time distributed swap edge algorithms 👍 👎
• Task swapping networks in distributed systems 👍 👎
• Distributed computation in dynamic networks 👍 👎
• Linear Time Distributed Swap Edge Algorithms 👍 👎
• Distributed edge connectivity in sublinear time 👍 👎
• Principles of Distributed Systems 👍 👎
• Distributed computations in fully-defective networks 👍 👎

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)