Entry Kloks:1997:TMF 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{Kloks:1997:TMF,
author = "Ton Kloks and Dieter Kratsch and Jeremy Spinrad",
title = "On treewidth and minimum fill-in of asteroidal
triple-free graphs",
journal = j-THEOR-COMP-SCI,
volume = "175",
number = "2",
pages = "309--335",
day = "10",
month = apr,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=175&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=175&issue=2&aid=2408",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
Technol., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asteroidal triple-free graphs; bounded dimension;
cocomparability graphs; computational complexity; graph
problems; graph theory; minimal separators; minimum
fill-in; minimum interval; NP-complete; pathwidth;
polynomial time algorithms; treewidth",
pubcountry = "Netherlands",
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,
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
- complete;, NP-,
137(1)129,
143(2)353,
147(1)117,
148(1)93,
163(1)161,
164(1)287,
165(2)233,
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
- dimension,
137(1)129,
137(2)177,
172(1)43,
178(1)265,
180(1)363,
188(1)79,
210(1)217
- interval,
143(1)73,
145(1)291,
148(1)93,
151(1)257,
162(1)151,
162(2)225,
166(1)1,
170(1)1,
173(1)3,
173(1)253,
174(1)171,
175(2)349,
205(1)115,
219(1)421
- minimal,
139(1)187,
143(1)1,
143(1)175,
145(1)317,
151(1)37,
155(1)157,
155(2)425,
159(1)43,
164(1)59,
165(2)441,
166(1)83,
166(1)147,
171(1)281,
173(1)89,
174(1)171,
175(2)293,
176(1)337,
180(1)169,
182(1)1,
183(1)93,
187(1)27,
187(1)167,
188(1)175,
190(2)151,
192(2)233,
193(1)75,
194(1)247-2,
212(1)77,
215(1)345,
218(1)161
- minimum,
140(2)291,
147(1)69,
158(1)117,
163(1)269,
165(2)311,
174(1)23,
181(1)57,
181(2)267,
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,
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
- pathwidth,
172(1)233
- separator,
168(1)121,
180(1)81,
180(1)169,
181(1)57
- treewidth,
172(1)233,
203(2)205,
209(1)1