Entry Maruyama:1996:ITW 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{Maruyama:1996:ITW,
author = "Osamu Maruyama and Satoru Miyano",
title = "Inferring a tree from walks",
journal = j-THEOR-COMP-SCI,
volume = "161",
number = "1--2",
pages = "289--300",
day = "15",
month = jul,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&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=161&issue=1-2&aid=2097",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Dept. of Inf. Syst., Kyushu Univ., Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "colour string; computability; computational
complexity; edge-colour sequence; graph colouring;
graph edges; inference mechanisms; linear chain
inference; NP-complete problem; partial walks;
solvability; tree inference; trees (mathematics);
undirected edge-colored graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- chain,
145(1)391,
147(1)267,
161(1)191,
163(1)291,
164(1)185,
175(2)283,
193(1)1,
205(1)85,
206(1)163
- colour,
147(1)211
- colouring,
154(1)3,
175(2)337,
176(1)39,
181(1)91,
203(2)225
- complete, NP-,
147(1)137,
148(1)19,
155(2)321,
186(1)157,
148(1)19
- 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,
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,
172(1)233,
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
- edge,
145(1)27,
164(1)59,
172(1)175,
174(1)137,
203(1)91,
203(2)225,
209(1)331,
211(1)375
- inference,
135(1)67,
137(1)3,
137(1)53,
138(1)201,
141(1)151,
141(1)253,
142(2)141,
143(1)51,
146(1)199,
149(1)129,
150(1)161,
151(2)437,
152(1)91,
152(2)219,
152(2)269,
154(2)183,
155(2)365,
164(1)13,
165(1)171,
166(1)291,
167(1)47,
167(1)73,
167(1)95,
170(1)129,
170(1)245,
171(1)61,
171(1)77,
171(1)147,
171(1)247,
172(1)91,
173(2)311,
175(1)75,
177(1)183,
185(1)15,
185(1)129,
185(2)217,
185(2)277,
189(1)129,
190(1)41,
192(1)3,
192(2)201,
194(1)247-2,
197(1)139,
219(1)3
- inferring,
138(1)201,
185(1)3
- mechanism,
135(1)67,
137(1)3,
137(1)53,
141(1)151,
141(1)253,
142(2)141,
143(1)51,
146(1)199,
149(1)129,
149(1)179,
150(1)161,
151(2)437,
152(1)91,
152(2)219,
152(2)269,
154(2)183,
155(2)365,
165(1)171,
166(1)291,
167(1)47,
167(1)73,
167(1)95,
170(1)129,
170(1)245,
171(1)61,
171(1)77,
171(1)147,
171(1)247,
172(1)91,
173(2)311,
174(1)123,
175(1)75,
177(1)183,
183(2)281,
185(1)47,
185(1)129,
185(2)217,
185(2)277,
187(1)221,
189(1)129,
190(1)41,
192(1)3,
192(1)77,
192(2)201,
194(1)245-2,
194(1)247-2,
197(1)139
- Miyano, Satoru,
148(1)57,
210(2)261
- NP-complete,
137(1)129,
143(2)353,
147(1)117,
147(1)137,
148(1)19,
148(1)93,
155(2)321,
163(1)161,
164(1)287,
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,
162(1)79,
162(2)225,
164(1)287,
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
- sequence,
139(1)27,
143(2)335,
144(1)101,
145(1)291,
145(1)317,
147(1)31,
148(1)1,
150(1)77,
151(1)163,
151(1)277,
155(2)321,
156(1)39,
158(1)35,
158(1)65,
158(1)81,
163(1)193,
163(1)211,
164(1)165,
165(2)233,
165(2)295,
168(2)267,
168(2)337,
170(1)349,
174(1)67,
174(1)171,
174(1)259,
178(1)155,
180(1)115,
180(1)203,
182(1)145,
182(1)233,
183(1)143,
184(1)61,
185(1)3,
188(1)161,
188(1)195,
191(1)185,
191(1)245,
194(1)240,
194(1)241-2,
194(1)244-2,
197(1)244-1,
205(1)337,
207(2)343,
207(2)363,
209(1)179,
209(1)261,
209(1)377,
210(2)305,
210(2)341,
215(1)31,
218(1)3,
218(1)177,
221(1)41,
225(1)185
- solvability,
142(1)27,
142(2)229,
160(1)145,
160(1)185,
179(1)301,
181(2)229
- string,
137(2)269,
141(1)53,
141(1)163,
143(1)113,
145(1)357,
147(1)19,
154(2)203,
154(2)225,
155(2)425,
155(2)447,
158(1)177,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
178(1)129,
180(1)203,
181(1)159,
191(1)205,
191(1)219,
194(1)87,
211(1)339,
218(1)205
- undirected,
159(1)65,
162(2)297,
169(2)147,
172(1)121,
180(1)169,
181(1)107,
192(1)3
- walk,
145(1)381,
169(2)147,
187(1)179,
187(1)z,
218(2)249