E.A. Stohr, "On the broadcast time of the butterfly network", Proc. 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 91), LNCS 570, pp. 226-229, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dissemination Of Information In Interconnection.. - Hromkovic, Klasing, .. (1996) (79 citations) (Correct)
....a lower bound of 1:1374k which is worse than the diameter lower bound. But for the DeBruijn network DB k , we can improve the lower bound by applying Theorem 2.3.1: Corollary 2.3.2 b(DB k ) 1:1374k for all sufficiently large k 2 IN : The technique of Liestman and Peters was extended by E. Stohr [St91b] who was the first to prove a non trivial lower bound of 1:5621k on the broadcast time of the butterfly network BF k . Her technique was again refined and extended in [KMPS92] where the lower bound was improved to the currently best one of 1:7417k. In order to make things easier to understand, ....
E.A. Stohr, "On the broadcast time of the butterfly network", Proc. 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 91), LNCS 570, pp. 226-229, 1991.
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (2 citations) (Correct)
....number of time units required to complete broadcasting from vertex u. The broadcast time of a graph G, b(G) is the maximum broadcast time over all vertices u in G. Broadcasting in graphs of bounded degree has been studied in [BHLP88] BP88] CGV89] HJM90] HOS91] LP88] St91a] and [St91b]. The maximum degree is an important parameter in the design of interconnection networks. This is one of the motivations to investigate broadcasting in graphs with fixed maximum degree, in particular in bounded degree approximations of the hypercube such as cube connected cycles, butterfly, ....
....were improved in [BHLP88] and [CGV89] where general lower bounds were obtained. A trivial lower bound on the broadcast time is the diameter of a graph. For cube connected cycles and shuffle exchange networks the broadcast time and the diameter differ at most by a constant [HJM90] LP88] In [St91b], a non trivial lower bound on the broadcast time of the Butterfly graph BF (m) was presented. It was shown that b(BF (m) 1:5621m for all sufficiently large m. Note that the diameter of BF (m) is D = b3m=2c. Thus, b(BF (m) cD for some constant c 1. In Section 3, we improve the result of ....
[Article contains additional citation context not shown here]
E.A. Stohr, "On the broadcast time of the butterfly network", Proc. 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 91), LNCS 570, pp. 226-229, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC