Entry Diaz:1997:PAM from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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",
}
Related entries
- bounded,
137(1)3,
139(1)131,
148(1)93,
151(1)163,
163(1)177,
164(1)59,
164(1)287,
166(1)203,
168(1)3,
168(1)21,
169(2)201,
172(1)135,
172(1)195,
173(1)183,
175(2)309,
176(1)89,
176(1)283,
178(1)103,
181(1)141,
182(1)145,
191(1)61,
193(1)53,
193(1)75,
193(1)113,
194(1)137,
194(1)247-1,
196(1)395,
204(1)11,
209(1)1
- complete;, NP-,
137(1)129,
143(2)353,
147(1)117,
148(1)93,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
186(1)107,
191(1)205,
197(1)245-2,
198(1)211
- CREW,
147(1)249,
164(1)1,
168(1)121,
169(1)67,
180(1)169
- cut,
157(2)215,
160(1)241,
176(1)235,
177(1)155
- degree,
147(1)137,
155(2)425,
157(1)129,
161(1)301,
161(1)307,
177(1)59,
180(1)353,
181(1)91,
181(1)119,
194(1)247-1,
205(1)261
- Gibbons, Alan,
154(1)3
- job,
162(2)341,
178(1)265
- layout,
217(2)175
- length,
139(1)355,
143(1)175,
148(1)111,
155(1)277,
155(2)425,
156(1)119,
159(1)65,
164(1)277,
178(1)129,
180(1)17,
183(1)21,
188(1)1,
188(1)241,
191(1)245,
215(1)1
- minimum,
140(2)291,
147(1)69,
158(1)117,
163(1)269,
165(2)311,
174(1)23,
175(2)309,
181(1)57,
181(2)347,
185(2)319,
188(1)1,
194(1)207,
206(1)301,
225(1)113
- NP-complete,
137(1)129,
143(2)353,
147(1)117,
147(1)137,
148(1)19,
148(1)93,
155(2)321,
161(1)289,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
186(1)107,
186(1)157,
191(1)205,
197(1)245-2,
198(1)211
- Pantziou, Grammati E.,
148(1)133,
168(1)121,
185(2)347
- PRAM,
143(2)309,
147(1)1,
147(1)249,
154(2)225,
155(2)349,
158(1)1,
162(2)245,
163(1)211,
164(1)1,
164(1)107,
164(1)299,
168(1)121,
169(1)67,
172(1)1,
174(1)193,
175(2)393,
178(1)225,
179(1)381,
180(1)169,
180(1)287,
188(1)221,
194(1)225,
196(1)3,
196(1)109,
205(1)231
- sequencing,
143(1)113
- Spirakis, Paul G.,
148(1)133,
168(1)121