Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation
Abstract
References
Index Terms
- Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation
Recommendations
Token Graphs
For a graph G and integer k ≥ 1, we define the token graph F k (G) to be the graph with vertex set all k-subsets of V(G), where two vertices are adjacent in F k (G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices ...
Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size
IPDPSW '11: Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD ForumSelf-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization. We consider the model introduced by Lee et al. where there is one designated ...
Broadcasting on cactus graphs
Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Other conferences](/cms/asset/ce4d5bb2-b2e9-4554-b937-e2f8dbd94f21/3350546.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Short-paper
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 26Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format