A self-stabilizing algorithm for constructing spanning trees
From MaRDI portal
Publication:1182088
DOI10.1016/0020-0190(91)90111-TzbMath0735.68004MaRDI QIDQ1182088
Shing-Tsaan Huang, Hwey-Pyng Yu, Nian-Shing Chen
Publication date: 27 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
Related Items
A self-stabilizing graph algorithm: Finding the cutting center of a tree, A self-stabilizing algorithm for the maximum flow problem, Self-stabilizing token circulation in uniform networks, A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks, Self-stabilizing silent disjunction in an anonymous network, Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks, Timer-based composition of fault-containing self-stabilizing protocols, A self-stabilizing algorithm for constructing breadth-first trees, A self-stabilizing algorithm for maximal matching, Self-stabilizing depth-first token circulation on networks, A self-stabilizing algorithm for strong fairness, Fault-containing self-stabilization using priority scheduling, A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph, A self-stabilizing algorithm for coloring bipartite graphs, Fault-containing self-stabilizing distributed protocols, The first fully polynomial stabilizing algorithm for BFS tree construction, SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS, A Framework for Certified Self-Stabilization, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, A self-stabilizing algorithm for the st-order problem
Cites Work
