Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.

DOI10.1016/S0743-7315(03)00040-6zbMath1055.68166OpenAlexW2104235299MaRDI QIDQ1398783

Yue-Li Wang, Sun-Jen Huang, Fu-Hsing Wang, Jou-Ming Chang

Publication date: 7 August 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-7315(03)00040-6

zbMATH Keywords

Interconnection networksDistributed algorithmsDirected split-starsDistance-\(k\) dominating set

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (6)

Super spanning connectivity of split-star networks ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ A note on leader election in directed split-stars and directed alternating group graphs ⋮ An efficient distributed algorithm for canonical labeling on directed split-stars ⋮ Statistical mechanics of the directed 2-distance minimal dominating set problem

This page was built for publication: Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.