论文信息 - k-Path Partitions in Trees

k-Path Partitions in Trees

For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2-path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for the k-path partition problem in trees. The algorithm is applicable to the problem of finding the minimum number of message originators necessary to broadcast a message to all vertices in a tree network in one or two time units.

Gerard J. Chang | Stephen T. Hedetniemi | Sandra Mitchell Hedetniemi | Jing-Ho Yan

[1] Maurizio A. Bonuccelli,et al. Minimum Node Disjoint Path Covering for Circular-Arc Graphs , 1979, Inf. Process. Lett..

[2] C. Pandu Rangan,et al. Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs , 1993, Theor. Comput. Sci..

[3] Robert E. Tarjan,et al. Optimal Chain Partitions of Trees , 1975, Inf. Process. Lett..

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

[5] C. Pandu Rangan,et al. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..

[6] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[7] S. Hedetniemi,et al. On the hamiltonian completion problem , 1974 .

[8] Wei-Kuan Shih,et al. An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs , 1992, SIAM J. Comput..

[9] Lorna Stewart,et al. Graph clustering: complexity, sequential and parallel algorithms , 1995 .

[10] Gerard J. Chang,et al. The Path-Partition Problem in Block Graphs , 1994, Inf. Process. Lett..

[11] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .