An efficient distributed algorithm for canonical labeling on directed split-stars

DOI10.1016/j.dam.2008.02.002zbMath1180.05115OpenAlexW2076986765MaRDI QIDQ1003736

Fu-Hsing Wang

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.02.002

zbMATH Keywords

time complexitydistributed algorithmscanonical labelingmessage complexitydirected split-stars

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Super spanning connectivity of split-star networks ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Conditional matching preclusion for the alternating group graphs and split-stars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
• A distributed algorithm to find \(k\)-dominating sets
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• Minimal feedback vertex sets in directed split‐stars

This page was built for publication: An efficient distributed algorithm for canonical labeling on directed split-stars