Entry Gupta:1996:CSI 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{Gupta:1996:CSI,
author = "Arvind Gupta and Naomi Nishimura",
title = "The complexity of subgraph isomorphism for classes of
partial $k$-trees",
journal = j-THEOR-COMP-SCI,
volume = "164",
number = "1--2",
pages = "287--298",
day = "10",
month = sep,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=164&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=164&issue=1-2&aid=2254",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded tree-width graphs; complete characterization;
complexity; computational complexity; connectivity
conditions; graph theory; NP-complete; partial
$k$-trees; subgraph isomorphism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $k$,
140(2)333,
161(1)23,
201(1)233,
205(1)45,
205(1)85,
209(1)1,
210(2)341
- bounded,
137(1)3,
139(1)131,
148(1)93,
151(1)163,
163(1)177,
164(1)59,
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,
181(2)267,
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
- characterization,
138(2)391,
140(1)5,
142(1)89,
143(1)1,
146(1)5,
147(1)55,
148(1)33,
150(1)77,
154(1)67,
154(1)85,
154(2)247,
154(2)379,
156(1)289,
160(1)321,
162(1)5,
162(1)45,
163(1)245,
163(1)303,
168(1)53,
169(2)185,
172(1)281,
175(2)239,
177(1)183,
179(1)301,
184(1)195,
186(1)1,
187(1)49,
189(1)1,
191(1)79,
191(1)117,
193(1)113,
195(2)227,
197(1)246-1,
205(1)135,
205(1)195,
209(1)123,
215(1)31,
218(2)297,
219(1)319,
226(1)37
- 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,
161(1)307,
162(1)5,
163(1)245,
163(1)283,
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
- 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,
161(1)307,
164(1)141,
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
- complete;, NP-,
137(1)129,
143(2)353,
147(1)117,
148(1)93,
163(1)161,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
191(1)205,
197(1)245-2,
198(1)211
- condition,
138(1)201,
139(1)27,
140(2)231,
140(2)249,
141(1)311,
144(1)251,
145(1)1,
146(1)331,
151(2)487,
152(1)91,
152(1)139,
154(2)349,
155(2)321,
156(1)217,
159(2)355,
161(1)191,
163(1)259,
165(1)97,
165(2)475,
165(2)483,
166(1)49,
166(1)101,
166(1)147,
167(1)193,
173(2)513,
174(1)97,
174(1)157,
177(1)155,
180(1)61,
182(1)183,
183(1)93,
183(2)253,
187(1)3,
191(1)219,
197(1)111,
197(1)203,
202(1)231,
220(1)67
- connectivity,
169(2)147,
173(1)151,
203(2)253
- isomorphism,
139(1)187,
145(1)189,
145(1)329,
152(1)67,
155(1)267,
180(1)17,
181(2)307,
197(1)242-3,
197(1)247
- 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,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
186(1)157,
191(1)205,
197(1)245-2,
198(1)211
- partial,
138(2)273,
139(1)163,
140(1)73,
151(1)195,
152(1)91,
154(2)379,
155(1)157,
155(2)291,
160(1)87,
161(1)289,
162(1)79,
162(2)225,
168(1)21,
168(1)155,
170(1)129,
170(1)145,
170(1)209,
171(1)247,
172(1)1,
173(2)513,
175(1)3,
175(1)127,
175(2)373,
179(1)217,
179(1)421,
180(1)243,
180(1)341,
181(1)195,
184(1)61,
184(1)145,
187(1)263,
190(2)167,
190(2)317,
192(1)55,
194(1)1,
194(1)183,
194(1)245,
194(1)246,
195(2)259,
197(1)245-2,
206(1)127,
206(1)181,
209(1)1,
210(1)121,
216(1)311,
218(1)135,
219(1)379,
224(1)215
- subgraph,
145(1)111,
145(1)147,
148(1)57,
161(1)307,
168(1)121,
172(1)209,
172(1)265,
181(1)91,
181(2)307,
203(1)91,
205(1)85,
205(1)261