Abstract
Broadcasting is the information dissemination process in a communication network. A subset of processors V 0 (V called originators knows an unique message which has to be transferred by calls between adjacent processors. Each call requires one time unit and each processor can participate in at most one call per time unit. The problem is to find a schedule such that the time needed to inform all processors is less than or equal to a deadline k ε IN. We present NP-completeness results for this problem restricted to several communication networks (bipartite planar graphs, grid graphs, complete ρid graphs, split graphs and chordal graphs) with constant deadline k=2 or one originator V 0={v}.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters: Broadcasting in bounded degree graphs, SIAM Journal on Discrete Mathematics 5 (1992), 10–24.
J.C. Bermond and C. Peyrat: Broadcasting in de Bruijn networks, Proc. 19. S-E Conference on Combinatorics, Graph Theory, and Computing (1978), 283–292.
R.M. Capocelli, L. Gargano and U. Vaccaro: Time bounds for broadcasting in bounded degree graphs, Workshop Graphtheoretical Concepts in Computer Science (1991), 19–33.
A.M. Farley and S.T. Hedetniemi: Broadcasting in grid graphs, Proc. 9. S-E Conference on Combinatorics, Graph Theory, and Computing (1978), 275–288.
A.M. Farley: Minimum broadcast networks, Networks 9 (1979), 313–332.
A.M. Farley and A. Proskurowski: Broadcasting in trees with multiple originators, SIAM Journal on Algebraic and Discrete Methods 2 (1981), 381–386.
M.R. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
M. Grigni and D. Peleg: Tight bounds on minimum broadcast networks, SIAM Journal on Discrete Mathematics 4 (1991), 207–222.
S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman: A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319–349.
A. Jakoby, R. Reischuk and C. Schindelhauer: Minimum Broadcast Time auf Graphen mit konstantem Grad, 18. Workshop über Komplexitätstheorie und effiziente Algorithmen, Forschungsbericht 92-17, Universität Trier (1992).
D. Lichtenstein: Planar formulae and their uses, SIAM Journal on Computing 11 (1982), 320–343.
A.L. Liestman and J.G. Peters: Broadcast Networks of bounded degree, SIAM Journal on Discrete Mathematics 1 (1988), 531–540.
M. Middendorf: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2, Information Processing Letters 46 (1993), 281–287.
P. Rosenstiehl and R.E. Tarjan: Rectilinear planar layouts of planar graphs and bipolar orientations, Discrete Computational Geometry 1 (1986), 434–353.
P.J. Slater, E.J. Cockayne and S.T. Hedetniemi: Information dissemination in trees, SIAM Journal on Computing 10 (1981), 692–701.
C.A. Tovey: A simplified NP-complete satisfiability problem, Discrete Applied Mathematics 8 (1984), 85–89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, K., Müller, H. (1994). The minimum broadcast time problem. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive