Self-stabilizing minimum spanning tree construction on message-passing networks

DOI10.1007/3-540-45414-4_14MaRDI QIDQ4436052zbMATH OpenFDO

Authors Lisa Higham, Zhiying Liang

Publication date 23 November 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2180/21800194.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• scientific article; zbMATH DE number 4058884
• Distributed self-stabilizing algorithm for minimum spanning tree construction
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph

Cited in

(17)

• Self-stabilizing multicast protocols for ad hoc networks.
• A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
• Compact routing messages in self-healing trees
• A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
• A leader election algorithm for dynamic networks with causal clocks
• A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
• scientific article; zbMATH DE number 4058884 (Why is no real title available?)
• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
• Distributed self-stabilizing algorithm for minimum spanning tree construction
• scientific article; zbMATH DE number 749815 (Why is no real title available?)
• Distributed Computing - IWDC 2003
• On underlay-aware self-stabilizing overlay networks
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• Communication efficient self-stabilizing leader election

This page was built for publication: Self-stabilizing minimum spanning tree construction on message-passing networks

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