A note on leader election in directed split-stars and directed alternating group graphs

DOI10.1080/00207160802676554zbMath1198.05145OpenAlexW2006827741MaRDI QIDQ3056381

Fu-Hsing Wang

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802676554

zbMATH Keywords

anonymous networksself-stabilizing algorithmssplit-starsleader election problemalternating group graphsdistributed algorithm design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
• Broadcasting in unlabeled hypercubes with a linear number of messages.
• Self-stabilizing systems in spite of distributed control
• Leader election in oriented star graphs
• Minimal feedback vertex sets in directed split‐stars

This page was built for publication: A note on leader election in directed split-stars and directed alternating group graphs