Entry Andreev:1996:CHD 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:1996:CHD,
author = "Alexander E. Andreev and Andrea E. F. Clementi and
Jos{\'e} D. P. Rolim",
title = "Constructing the highest degree subgraph for dense
graphs is in {NCAS}",
journal = j-THEOR-COMP-SCI,
volume = "161",
number = "1--2",
pages = "307--314",
day = "15",
month = jul,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=1996&volume=161&issue=1-2&aid=2217",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Dept. of Math. and Mech., Moscow Univ., Russia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximability; approximate solutions; approximation
theory; computational complexity; dense graphs; graph
theory; highest-degree subgraph; NC-approximation
scheme; NCAS class; P- complete problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Andreev, Alexander E.,
180(1)243,
221(1)3
- approximability,
147(1)181,
181(1)107,
209(1)237
- approximate,
145(1)271,
149(1)129,
150(1)1,
172(1)91,
173(1)113,
179(1)319,
181(1)159,
188(1)79,
191(1)229,
201(1)263,
203(1)151,
210(2)341,
219(1)185
- approximation,
134(1)51,
137(1)145,
138(1)3,
143(1)167,
143(2)353,
144(1)67,
147(1)267,
150(1)1,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)161,
157(2)259,
158(1)117,
159(2)143,
161(1)1,
162(2)173,
162(2)351,
165(1)57,
168(1)3,
168(1)39,
172(1)255,
173(1)49,
174(1)23,
177(1)3,
178(1)265,
179(1)319,
179(1)427,
180(1)17,
180(1)243,
181(2)379,
182(1)233,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
190(2)151,
190(2)167,
191(1)1,
197(1)111,
207(1)171,
209(1)107,
210(2)261,
210(2)327,
212(1)261,
266(1)997
- class,
139(1)187,
140(1)179,
140(2)291,
141(1)175,
143(1)149,
144(1)251,
145(1)111,
148(2)207,
149(2)201,
149(2)299,
150(1)1,
151(2)385,
152(1)67,
152(2)251,
153(1)49,
154(1)23,
154(2)145,
154(2)307,
154(2)367,
155(1)111,
155(1)141,
155(2)447,
157(2)227,
158(1)193,
158(1)221,
158(1)361,
160(1)305,
161(1)263,
161(1)301,
162(1)5,
163(1)245,
163(1)283,
164(1)287,
165(2)355,
167(1)171,
170(1)407,
172(1)43,
172(1)91,
174(1)67,
174(1)231,
174(1)269,
176(1)39,
176(1)205,
177(1)59,
177(1)139,
178(1)37,
179(1)217,
180(1)139,
180(1)155,
180(1)217,
180(1)325,
183(1)93,
185(1)159,
185(1)177,
186(1)231,
188(1)79,
188(1)101,
190(1)87,
191(1)215,
194(1)137,
194(1)246,
195(1)33,
195(2)113,
195(2)183,
195(2)205,
197(1)247,
198(1)225,
203(1)123,
207(1)217,
209(1)225,
211(1)253,
226(1)29,
234(1)323
- Clementi, Andrea E. F.,
180(1)243,
221(1)3,
225(1)113
- complete,
138(2)273,
138(2)391,
141(1)337,
142(2)209,
143(1)51,
145(1)147,
146(1)243,
146(1)321,
147(1)1,
147(1)69,
147(1)137,
152(2)251,
154(1)107,
154(2)247,
154(2)283,
160(1)185,
160(1)241,
164(1)141,
164(1)287,
166(1)203,
168(1)53,
168(1)155,
170(1)145,
170(1)245,
172(1)195,
176(1)89,
179(1)421,
183(2)229,
184(1)61,
184(1)237,
189(1)239,
190(2)279,
192(2)259,
192(2)315,
193(1)53,
195(1)61,
197(1)244-2,
206(1)331,
211(1)339,
220(2)363,
221(1)157
- constructing,
154(2)225,
177(1)73,
180(1)309,
187(1)3,
194(1)244-1
- degree,
147(1)137,
155(2)425,
157(1)129,
161(1)301,
177(1)59,
180(1)353,
181(1)91,
181(1)119,
181(2)267,
194(1)247-1,
205(1)261
- dense,
138(1)113,
174(1)157,
179(1)251,
189(1)179,
196(1)109,
201(1)281
- P,
154(2)145,
155(1)111,
155(1)267,
193(1)181,
198(1)99
- Rolim, José D. P.,
180(1)243,
221(1)3
- scheme,
143(2)269,
144(1)161,
145(1)291,
162(2)297,
164(1)29,
177(1)217,
178(1)265,
179(1)301,
187(1)203,
193(1)97,
196(1)259,
201(1)85
- solution,
145(1)71,
148(1)67,
150(1)1,
155(1)267,
157(1)115,
161(1)93,
168(1)121,
168(2)367,
173(1)3,
173(1)113,
178(1)265,
181(2)379,
187(1)27,
191(1)229,
205(1)307,
215(1)1,
216(1)395,
225(1)171
- subgraph,
145(1)111,
145(1)147,
148(1)57,
164(1)287,
168(1)121,
172(1)209,
172(1)265,
181(1)91,
181(2)307,
203(1)91,
205(1)85,
205(1)261