BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR93-189
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Efficient Parallel Algorithms for some Tree Layout Problems
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Diaz, J.
AUTHOR:: Gibbons, A.
AUTHOR:: Pantziou, Grammati E.
AUTHOR:: Serna, M.
AUTHOR:: Spirakis, Paul G.
AUTHOR:: Toran, J.
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1993
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR93-189.pdf
ABSTRACT::
	The minimum cut and minimum length linear arrangement problems
usually occur in solving wiring problems and have a lot in common with
job sequencing questions. Both problems are NP-complete for general
graphs and in P for trees. We present here two algorithms in NC. The
first solves the minimum length linear arrangement problem for
unrooted trees in $O(\log^2 n)$ time and $O(n^2 3^{\log n})$ CREW PRAM
processors. The second algorithm solves the minimum cut arrangement
for unrooted trees of maximum degree $d$ in $O(d \log^2 n)$ time and
$O(n^2 /\log n)$ CREW PRAM processors.
END:: ncstrl.dartmouthcs//TR93-189