Entry Giakoumakis:1997:ERE 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{Giakoumakis:1997:ERE,
author = "Vassilis Giakoumakis and Jean-Marie Vanherpe",
title = "On extended {$P_4$}-reducible and extended
{$P_4$}-sparse graphs",
journal = j-THEOR-COMP-SCI,
volume = "180",
number = "1--2",
pages = "269--286",
day = "10",
month = jun,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=180&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=1997&volume=180&issue=1-2&aid=2423",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Univ. de Picardie Jules Verne, Amiens, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classical optimization; computational complexity;
graph theory; linear recognition; NP-complete; O(n)
time algorithms; P/sub 4/-reducible; sparse graphs;
tree representation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $P_4$,
145(1)329
- classical,
139(1)243,
148(2)303,
153(1)49,
162(1)23,
168(2)267,
175(1)75,
176(1)159,
178(1)155,
179(1)427,
188(1)211,
197(1)157,
197(1)241,
197(1)242,
197(1)247,
198(1)239,
227(1)43
- 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,
181(1)159,
181(2)267,
186(1)107,
191(1)205,
197(1)245-2,
198(1)211
- extended,
143(1)51,
151(1)207,
158(1)279,
162(1)79,
164(1)123,
166(1)63,
170(1)383,
171(1)281,
173(2)445,
190(1)41,
205(1)317,
206(1)1,
207(1)73
- 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,
181(1)159,
181(2)267,
186(1)107,
186(1)157,
191(1)205,
197(1)245-2,
198(1)211
- O(n),
197(1)157
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- P/sub,
145(1)329
- recognition,
140(2)319,
143(1)73,
143(2)343,
145(1)329,
145(1)357,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
156(1)281,
160(1)217,
163(1)117,
163(1)303,
172(1)209,
173(2)349,
175(2)349,
175(2)393,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
181(2)379,
197(1)189,
201(1)99
- reducible,
137(1)129,
145(1)329,
190(2)363
- reducible, -,
145(1)329
- representation,
137(1)25,
138(1)201,
139(1)315,
140(1)5,
143(1)73,
145(1)329,
147(1)87,
151(1)277,
154(2)283,
157(1)53,
160(1)321,
163(1)161,
165(2)391,
166(1)1,
166(1)221,
167(1)193,
172(1)175,
172(1)255,
174(1)67,
175(2)239,
175(2)373,
176(1)1,
177(2)329,
178(1)1,
179(1)61,
179(1)301,
179(1)319,
179(1)427,
180(1)47,
182(1)183,
185(1)15,
187(1)81,
188(1)211,
193(1)181,
200(1)261,
210(1)159,
217(2)291,
217(2)359,
219(1)19,
225(1)1
- sparse,
156(1)301,
157(2)259,
203(1)123