Entry Dendris:1997:FSG 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{Dendris:1997:FSG,
author = "Nick D. Dendris and Lefteris M. Kirousis and Dimitrios
M. Thilikos",
title = "Fugitive-search games on graphs and related
parameters",
journal = j-THEOR-COMP-SCI,
volume = "172",
number = "1--2",
pages = "233--254",
day = "10",
month = feb,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:35 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=172&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=172&issue=1-2&aid=2390",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240C (Computational complexity); C4260
(Computational geometry)",
corpsource = "Dept. of Comput. Eng. and Inf., Patras Univ., Greece",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean satisfiability problems; computability;
computational complexity; computational geometry;
constraint satisfaction; fugitive-search games; graph
parameters; graph theory; graphs; pathwidth;
polynomially computable graph parameter; treewidth;
vertices",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "M. D. Dendris and L. M. Kirousis and D. M. Thilikos",
}
Related entries
- boolean,
134(1)51,
137(1)109,
137(1)159,
137(2)237,
138(2)353,
139(1)187,
141(1)283,
143(2)335,
143(2)343,
145(1)45,
145(1)371,
155(2)411,
156(1)99,
157(2)139,
160(1)1,
160(1)321,
160(1)365,
161(1)141,
161(1)301,
163(1)1,
163(1)283,
168(1)39,
171(1)3,
172(1)135,
172(1)293,
174(1)137,
175(2)257,
175(2)337,
179(1)251,
179(1)427,
180(1)47,
180(1)155,
180(1)243,
182(1)257,
186(1)171,
188(1)117,
188(1)211,
190(2)317,
191(1)79,
197(1)247,
205(1)317,
207(2)329,
217(2)255,
223(1)193,
226(1)207
- C4260,
137(1)145,
137(2)177,
140(2)205,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
141(1)337,
143(1)113,
143(1)175,
143(2)189,
143(2)309,
143(2)343,
145(1)27,
145(1)241,
145(1)329,
145(1)381,
147(1)211,
148(1)57,
148(1)93,
151(1)257,
155(2)321,
156(1)1,
156(1)159,
157(1)35,
157(1)53,
157(1)z,
157(2)185,
159(1)103,
159(1)105,
159(1)129,
159(1)137,
162(2)351,
163(1)303,
164(1)59,
164(1)165,
168(1)121,
169(2)147,
172(1)121,
172(1)175,
172(1)209,
172(1)265,
174(1)193,
175(2)239,
180(1)363,
181(1)3,
181(1)57,
181(1)91,
181(1)107,
182(1)233,
186(1)1,
188(1)59,
188(1)129,
191(1)193,
194(1)z,
197(1)203
- computability,
137(1)129,
139(1)243,
142(1)27,
145(1)111,
147(1)31,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
160(1)365,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)145,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- computable,
139(1)243,
143(1)113,
145(1)241,
161(1)235,
162(1)45,
162(1)117,
169(1)67,
175(1)183,
188(1)175,
192(2)315,
194(1)247-1,
197(1)79,
210(1)3,
219(1)95,
219(1)111,
219(1)169,
219(1)319,
221(1)157,
224(1)13
- constraint,
138(1)211,
141(1)151,
142(1)27,
142(2)141,
151(1)37,
151(1)z,
156(1)217,
158(1)279,
160(1)365,
166(1)101,
167(1)73,
171(1)25,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
175(2)349,
179(1)273,
183(2)281,
184(1)195,
185(1)81,
187(1)49,
190(2)115,
190(2)151,
192(1)77,
192(1)107,
192(2)259,
192(2)315,
193(1)149,
197(1)1,
206(1)81,
206(1)257,
221(1)179,
225(1)113
- parameter,
144(1)125,
147(1)31,
150(1)111,
155(1)141,
159(1)65,
183(2)215,
187(1)147,
187(1)249,
215(1)289,
224(1)13
- pathwidth,
175(2)309
- related,
148(2)281,
162(2)173,
188(1)59,
224(1)319
- satisfaction,
139(1)275,
142(1)27,
167(1)3,
173(1)3,
173(1)235
- satisfiability,
137(1)129,
139(1)1,
145(1)111,
146(1)243,
150(1)1,
155(1)277,
160(1)365,
161(1)109,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
175(2)349,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183
- treewidth,
175(2)309,
203(2)205,
209(1)1
- vertex,
140(2)265,
145(1)27,
147(1)249,
154(2)247,
157(2)161,
158(1)117,
172(1)265,
174(1)23,
174(1)193,
175(2)239,
225(1)113