Regular Article
A Broadcasting Protocol in Line Digraphs

https://doi.org/10.1006/jpdc.2001.1737Get rights and content

Abstract

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 LkG, 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.

References (16)

  • J.-C. Bermond et al.

    Hamilton circuits in directed wrapped butterfly network

    Discrete Appl. Math.

    (1998)
  • M.C. Heydemann et al.

    Broadcasting and spanning tree in De Bruijn and Kautz networks

    Discrete Appl. Math.

    (1992)
  • J.-C. Bermond et al.

    Broadcasting in bounded degree graphs

    SIAM J. Discrete Math.

    (1992)
  • J.-C. Bermond et al.

    Efficient broadcast protocols on the de Bruijn and similar networks

    Proceedings of SIROCCO'95

    (1995)
  • J.-C. Bermond et al.

    Broadcasting in De Bruijn networks

    Proc. of the 19th S-E Conf. on Combin., Graph Theory and Comp.

    (1988)
  • J.-C. Bermond et al.

    De Bruijn and Kautz bus Networks

    Networks

    (1997)
  • J.-C. Bermond et al.

    Induced broadcasting algorithms in iterated line digraphs

    Proc. EUROPAR'96

    (1996)
There are more references available in the full text version of this article.

Cited by (0)

An extended abstract of this article was presented at “EUROPAR'96” and obtained the qualification of “distinguished paper” [6]. This work was partially supported by the HCM Network of Excellence project MAP. Part of this work was developed while J-C. Bermond and X. Muñoz were visiting the University of Rome “La Sapienza.”

f1

E-mail: [email protected]

f2

E-mail: [email protected]

f3

E-mail: [email protected]

2

Supported by the French action RUMEUR of the GDR PRS.

3

Supported by the Spanish Research Council (Comisión Interministerial de Ciencia y Tecnologı́a, CICYT) under Project TIC 92-1228-E.

4

Supported by Project MURST 40% Algoritmi e strutture di calcolo.

View full text