Linear time distributed swap edge algorithms

DOI10.1007/978-3-642-38233-8_11zbMATH Open1382.68166OpenAlexW3199417267MaRDI QIDQ4924643FDOQ4924643

Authors: Ajoy K. Datta, Lawrence L. Larmore, L. Pagli, G. Prencipe 

Publication date: 7 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_11

Recommendations

• Linear time distributed swap edge algorithms
• Distributed Computing - IWDC 2004
• Finding best swap edges minimizing the routing cost of a spanning tree
• Finding best swap edges minimizing the routing cost of a spanning tree
• A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

Mathematics Subject Classification ID

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

Cited In (4)

• Computing all the best swap edges distributively
• Efficient management of transient station failures in linear radio communication networks with bases
• Distributed Computing - IWDC 2004
• Linear time distributed swap edge algorithms

This page was built for publication: Linear time distributed swap edge algorithms

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