scientific article; zbMATH DE number 2006653
From MaRDI portal
Publication:4436052
zbMATH Open1024.68514MaRDI QIDQ4436052FDOQ4436052
Authors: Lisa Higham, Zhiying Liang 
Publication date: 23 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800194.htm
Title of this publication is not available (Why is that?)
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
- scientific article; zbMATH DE number 1760042
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
Cited In (16)
- Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
- On underlay-aware self-stabilizing overlay networks
- Distributed Computing - IWDC 2003
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- Self-stabilizing multicast protocols for ad hoc networks.
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Title not available (Why is that?)
- Compact routing messages in self-healing trees
- A leader election algorithm for dynamic networks with causal clocks
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Title not available (Why is that?)
- Communication efficient self-stabilizing leader election
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
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 Q4436052)
