Entry Andreev:1998:PCA 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{Andreev:1998:PCA,
author = "A. E. Andreev and A. Clementi and P. Crescenzi and E.
Dahlhaus and S. {De Agostino} and J. D. P. Rolim",
title = "The parallel complexity of approximating the high
degree subgraph problem",
journal = j-THEOR-COMP-SCI,
volume = "205",
number = "1--2",
pages = "261--282",
day = "28",
month = sep,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:22:05 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=205&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/205/1-2/2811.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- approximating,
151(1)163,
175(2)271,
209(1)287,
210(2)245
- Crescenzi, P.,
150(1)1,
203(1)51
- 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,
181(2)267,
194(1)247-1
- high,
135(1)67,
140(1)179,
142(1)59,
144(1)101,
146(1)109,
146(1)145,
149(1)3,
149(1)67,
149(1)101,
151(1)195,
152(1)67,
155(1)111,
160(1)217,
160(1)321,
165(1)201,
167(1)131,
168(1)155,
169(1)81,
170(1)145,
173(1)3,
173(1)151,
175(1)183,
176(1)175,
176(1)283,
176(1)337,
179(1)273,
181(1)45,
181(1)195,
183(2)157,
183(2)281,
184(1)145,
185(2)259,
185(2)319,
187(1)147,
190(2)211,
190(2)279,
190(2)317,
192(2)201,
193(1)149,
193(1)215,
194(1)246-1,
196(1)289,
197(1)241,
197(1)247
- subgraph,
145(1)111,
145(1)147,
148(1)57,
161(1)307,
164(1)287,
168(1)121,
172(1)209,
172(1)265,
181(1)91,
181(2)307,
203(1)91,
205(1)85