A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
From MaRDI portal
Publication:4397213
DOI10.7155/jgaa.00005zbMath0895.68063MaRDI QIDQ4397213
Hiroyuki Ebara, Hajime Maeda, Hideo Nakano, Leqiang Bai
Publication date: 5 July 1998
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/47959
68W10: Parallel algorithms in computer science
Related Items
Linearly many faults in arrangement graphs, Unnamed Item, Conditional matching preclusion for the arrangement graphs, Maximal vertex-connectivity of