Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Diaz:1997:PAM,
author = "Josep D{\'\i}az and Alan Gibbons and Grammati E.
Pantziou and Maria J. Serna and Paul G. Spirakis and
Jacobo Toran",
title = "Parallel algorithms for the minimum cut and the
minimum length tree layout problems",
journal = j-THEOR-COMP-SCI,
volume = "181",
number = "2",
pages = "267--287",
day = "30",
month = jul,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=181&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=181&issue=2&aid=2476",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
conflocation = "Xi'an, China; 24-26 Aug. 1995",
conftitle = "First Annual International Computing and Combinatorics
Conference",
corpsource = "Dept. de Llenguatges i Sistemes, Univ. Politecnica de
Catalunya, Barcelona, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded degree trees; computational complexity; CREW
PRAM; graph theory; job sequencing; minimum cut;
minimum length tree layout; NP-complete; parallel
algorithms; trees; trees (mathematics)",
pubcountry = "Netherlands",
sponsororg = "Nat. Natural Sci. Found.; Xi'an Jiaotong Univ.;
Chinese Acad. Sci",
treatment = "T Theoretical or Mathematical",
}