.png){kind=icon}
.png){kind=icon}
Return
A broadcasting protocol in line digraphs
.png){kind=icon}
OA
AI
DOI：10.1006/jpdc.2001.1737.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose broadcasting algorithms for line digraphs in the telegraph model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph L(k)G, the graph obtained by applying k times, the line digraph operation to G. As a consequence improved bounds for the broadcasting time in De Bruijn, Kautz, and Wrapped Butterfly digraphs are obtained. (C) 2001 Academic Press.
Keywords:
broadcasting line digraphs
Kautz
Bruijn
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available