The Complexity of Broadcasting in Planar and Decomposable Graphs

Broadcasting in processor networks means disseminating a single piece of information, which is originally known only at some nodes, to all members of the network. The goal is to inform everybody using as few rounds as possible, that is to minimize the broadcasting time.

[1]  Arthur L. Liestman,et al.  Broadcasting in Bounded Degree Graphs , 1992, SIAM J. Discret. Math..

[2]  Ton Kloks,et al.  Better Algorithms for the Pathwidth and Treewidth of Graphs , 1991, ICALP.

[3]  Arthur L. Liestman,et al.  Broadcast Networks of Bounded Degree , 1988, SIAM J. Discret. Math..

[4]  Walter Holberg,et al.  The decomposition of graphs into k-connected components , 1992, Discret. Math..

[5]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[6]  E. J. COCKAYNE,et al.  Information Dissemination in Trees , 1981, SIAM J. Comput..

[7]  Rüdiger Reischuk,et al.  Graph Theoretical Methods for the Design of Parallel Algorithms , 1991, FCT.

[8]  Martin E. Dyer,et al.  Planar 3DM is NP-Complete , 1986, J. Algorithms.

[9]  J. Lagergren.  Efficient parallel algorithms for tree-decomposition and related problems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[11]  Juraj Hromkovic,et al.  Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract) , 1990, MFCS.

[12]  Martin Middendorf,et al.  Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2 , 1993, Inf. Process. Lett..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.