论文信息 - The MINSUMCUT Problem - 字舞流文

The MINSUMCUT Problem

In this paper we first present a sequential linear algorithm for a linear arrangement problem on trees, MINSUMCUT, and then an O(log n)-time parallel algorithm for MINSUMCUT on trees, which uses n2/(logn) processors.

Jacobo Torán | Alan Gibbons | Josep Díaz | Mike Paterson

[1] Mihalis Yannakakis. A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) , 1983, FOCS.

[2] Wojciech Rytter,et al. Optimally Edge-Colouring Outerplanar Graphs is in NC , 1990, Theor. Comput. Sci..

[3] Maurice Hanan,et al. A review of the placement and quadratic assignment problems , 1972 .

[4] D. Adolphson. Optimal linear-ordering. , 1973 .

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

[6] Yossi Shiloach,et al. A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..

[7] David S. Johnson,et al. COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[8] Wojciech Rytter,et al. Efficient parallel algorithms , 1988 .

[9] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[10] Wojciech Rytter,et al. Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition , 1989, Inf. Comput..