Entry Stewart:1995:CPM 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{Stewart:1995:CPM,
author = "Iain A. Stewart",
title = "Complete problems for monotone {NP}",
journal = j-THEOR-COMP-SCI,
volume = "145",
number = "1--2",
pages = "147--157",
day = "10",
month = jul,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&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=1995&volume=145&issue=1-2&aid=1809",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity)",
corpsource = "Dept. of Comput. Sci., Univ. Coll. of Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "comparability graphs; complete problems; computational
complexity; cubic subgraph; digraph; Hamiltonian path;
monotone NP; monotone projection translations;
polynomial-time reductions; uniquely partially
orderable graphs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- complete,
138(2)273,
138(2)391,
141(1)337,
142(2)209,
143(1)51,
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,
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
- cubic,
145(1)111,
148(1)111,
226(1)19
- digraph,
168(1)121,
203(1)69,
203(2)205,
207(1)193
- Hamiltonian,
143(2)189,
145(1)111,
204(1)233
- monotone,
137(1)159,
145(1)271,
151(1)3,
163(1)283,
178(1)225,
209(1)389,
223(1)193
- NP,
137(2)279,
141(1)175,
145(1)111,
147(1)55,
147(1)181,
148(2)207,
148(2)325,
150(1)1,
154(2)145,
154(2)283,
157(2)161,
158(1)143,
158(1)221,
160(1)185,
164(1)59,
164(1)141,
174(1)97,
181(2)229,
189(1)239
- orderable,
172(1)209
- partially,
138(2)425,
157(2)161,
160(1)87,
163(1)1,
171(1)247,
175(2)225,
196(1)365,
220(1)185
- path,
139(1)355,
140(2)205,
140(2)231,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
142(2)179,
142(2)277,
143(1)175,
143(2)343,
145(1)27,
145(1)45,
145(1)111,
145(1)329,
157(1)53,
157(1)101,
159(1)65,
160(1)87,
161(1)1,
166(1)49,
168(1)121,
175(1)127,
176(1)67,
183(1)21,
186(1)171,
188(1)1,
190(1)41,
196(1)395,
203(1)143,
203(2)205,
208(1)33,
215(1)89,
225(1)163
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- projection,
155(2)321,
159(1)129,
177(2)351
- reduction,
135(1)67,
139(1)69,
146(1)269,
148(1)19,
148(2)183,
148(2)325,
151(2)353,
151(2)437,
152(1)91,
154(1)3,
154(1)23,
155(1)85,
155(2)447,
158(1)361,
159(2)191,
161(1)69,
165(1)75,
166(1)1,
168(1)3,
170(1)83,
173(1)151,
175(1)93,
177(1)183,
181(2)229,
185(2)237,
188(1)101,
189(1)221,
190(1)3,
190(1)61,
191(1)97,
191(1)157,
192(1)31,
192(1)55,
194(1)241-2,
194(1)244-1,
194(1)244-3,
194(1)245-2,
194(1)247-2,
194(1)248-2,
197(1)242-2,
198(1)239,
209(1)47,
212(1)211,
225(1)185
- subgraph,
145(1)111,
148(1)57,
161(1)307,
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
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- translation,
140(1)53,
148(2)303,
150(1)161,
152(1)67,
159(1)103,
160(1)271,
169(1)3,
169(2)201,
193(1)197,
199(1)25,
220(2)409