Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set

Pradip K Srimani; Zhenyu Xu

doi:10.1109/ICDCSW.2007.73

27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07)

Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set

Year: 2007, Pages: 3

DOI Bookmark: 10.1109/ICDCSW.2007.73

Authors

Pradip K Srimani, Clemson University,USA
Zhenyu Xu, Clemson University,USA

Abstract

In this paper, we present a self-stabilizing algorithm that computes the breadth first spanning tree in arbitrary graph, with O(n3) time complexity using the unfair central daemon. We then propose a self-stabilizing algorithm to compute the weakly connected minimal dominating set in a graph using the same model and provide its correctness and complexity analysis; as far as we know, this is the first self-stabilizing algorithm to compute such sets.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!

A self-stabilizing minimal dominating set algorithm with safe convergence
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
Snap-Stabilizing PIF and Useless Computations
Parallel and Distributed Systems, International Conference on
Self-Stabilizing Anonymous Leader Election in a Tree
Parallel and Distributed Processing Symposium, International
Self-Stabilizing Small k-Dominating Sets
2011 Second International Conference on Networking and Computing
Self-stabilizing wavelets and ?-hops coordination
2008 IEEE International Parallel & Distributed Processing Symposium
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel & Distributed Systems
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States
IEEE Transactions on Parallel & Distributed Systems
Self-Stabilizing Algorithm for Dynamically Maintaining Two Disjoint Dominating Sets
2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)
A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
An O(n²) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs
2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)

Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set

Authors

Abstract

Related Articles