Parallel algorithms for the minimum cut and the minimum length tree layout problems

Theoretical Computer Science

Volumn 181, Issue 2, 1997, Pages 267-287

  Díaz, Josep ^a   Gibbons, Alan ^b   Pantziou, Grammati E ^c   Serna, Maria J ^a   Spirakis, Paul G ^c   Toran, Jacobo ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c Univ of Patras   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

MINIMUM CUT TREE LAYOUT PROBLEMS; MINIMUM LENGTH TREE LAYOUT PROBLEMS;

PARALLEL ALGORITHMS;

EID: 0031176531     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00274-5     Document Type: Article

References (14)

1. K. Abrahamson, N. Dadoun, D. Kirkpatrick and K. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989) 287-302.
2. D. Adolphson and T.C. Hu, Optimal linear ordering, SIAM J. Appl. Math. 25 (1973) 403-423.
3. M. Chung, F. Makedon, I.H. Sudborough and J. Turner, Polynomial time algorithms for the min cut problem on degree restricted trees, in: Proc. IEEE Symp. on Foundations of Computer Science (FOCS) (1982) 262-271.
4. J. Díaz, Graph layout problems, in: Proc. of Symp. on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Vol. 629 (Springer, Berlin, 1992) 14-23.
5. J. Díaz, A. Gibbons, G. Pantziou, M. Sema, P. Spirakis and J. Toran, Parallel algorithms for some tree layout problems, in: Proc. Computing and Combinatorics Conf. (COCOON), Lecture Notes in Computer Science (Springer, Berlin, 1995).
6. S. Even and Y. Shiloach, NP-completeness of several arrangements problems, Tech. Report, TR-43, The Technion, Haifa, 1978.
7. F. Gavril, Some NP-complete problems on graphs, in: Proc. 11th. Conf. on Information Sciences and Systems (1977) 91-95.
8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Fransisco, 1979).
9. L.H. Harper, Optimal numberings and isoperimetric problems on graphs, J. Combin. Theory 1 (1966) 385-393.
10. R. Karp and V. Ramachandran, Parallel algorithms for shared memory machines, in: J. van Leewen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990) 869-942.
11. B. Monien and I.H. Sudborough, Min cut is NP-complete for edge weighted trees, in: Proc. 13th Coll. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science (Springer, Berlin, 1986) 265-274.
12. M.T. Shing and T.C. Hu, Computational complexity of layout problems, in: T. Ohtsuki, ed., Layout Design and Verification (North Holland, Amsterdam, 1986) 267-294.
13. Y. Shiloach, A minimum linear arrangement algorithm for undirected trees, SIAM J. Comput. 8 (1979) 15-31.
14. M. Yannakakis, A polynomial algorithm for the min cut linear arrangement of trees, J. ACM 32 (1985) 950-988.