Entry Syslo:1982:SIP from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Syslo:1982:SIP,
author = "M. M. Syslo",
title = "The subgraph isomorphism problem for outerplanar
graphs",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "91--97",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Computer Sci. Dept., Washington State Univ., Pullman,
WA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "forests; graph theory; NP problem; outerplanar graphs;
polynomial algorithm; subgraph isomorphism; trees",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- B0250,
11(1)93,
11(2)117,
13(2)137,
16(1)5,
17(1)29,
17(1)75,
17(1)103,
17(2)151,
18(1)89,
19(1)1,
21(1)91,
21(1)99,
22(3)233,
23(3)273,
24(2)161,
28(1)171,
29(1)49,
29(1)75,
29(3)251,
30(3)241,
31(1)31,
31(1)61,
31(1)73,
31(3)307,
34(1)3
- C1160,
11(1)39,
11(1)93,
11(2)117,
11(2)123,
11(3)247,
12(1)83,
13(2)137,
13(3)315,
14(1)103,
15(1)1,
15(2)159,
15(3)321,
16(1)5,
17(1)29,
17(1)75,
17(1)103,
17(2)151,
17(2)217,
18(1)89,
18(2)115,
18(3)259,
19(1)1,
19(1)17,
19(1)29,
19(1)69,
19(2)189,
21(1)55,
21(1)91,
21(1)99,
22(3)233,
22(3)253,
22(3)331,
23(1)37,
23(1)83,
23(2)129,
23(2)211,
23(3)231,
23(3)243,
23(3)273,
24(2)143,
24(2)161,
25(2)95,
25(3)311,
28(1)171,
29(1)49,
29(1)75,
29(3)251,
30(3)241,
31(1)31,
31(1)61,
31(1)73,
31(3)307,
32(1)1,
32(1)87,
32(1)121,
32(1)173,
32(1)185,
32(1)215,
32(3)227,
32(3)309,
33(2)239,
34(1)3,
34(1)17,
34(1)33,
34(1)83,
34(1)169,
34(3)275,
34(3)337,
34(3)343
- forests,
22(1)219
- isomorphism,
17(1)75,
21(1)91,
27(1)3,
31(3)263,
34(1)33
- NP,
10(2)111,
11(1)93,
12(1)83,
15(1)27,
15(1)41,
15(2)181,
17(1)55,
19(3)287,
21(3)255,
24(3)279,
31(1)41,
34(1)17
- polynomial,
10(1)1,
10(1)53,
10(2)111,
11(1)93,
11(3)321,
11(3)331,
11(3)337,
12(1)1,
12(2)161,
12(3)303,
13(3)271,
14(1)91,
14(3)289,
15(1)27,
15(1)77,
15(3)251,
15(3)279,
15(3)329,
16(2)223,
17(2)163,
18(1)95,
19(1)17,
19(3)287,
21(1)99,
21(1)105,
21(2)179,
21(3)255,
22(1)195,
22(3)285,
22(3)317,
23(1)95,
24(3)291,
25(1)67,
26(1)25,
27(1)3,
27(1)127,
28(1)135,
31(1)101,
31(1)125,
31(3)227,
32(1)61,
32(3)279,
34(1)17,
34(1)207
- subgraph,
10(2)111,
19(2)189,
32(1)185
- tree,
10(1)63,
11(2)181,
11(3)303,
11(3)337,
12(2)175,
12(2)193,
12(3)265,
13(2)175,
13(2)193,
14(1)1,
14(1)79,
16(1)5,
16(2)223,
17(3)279,
18(2)115,
19(1)1,
19(3)253,
20(2)95,
22(1)209,
22(1)219,
22(3)253,
23(2)187,
23(3)231,
23(3)273,
23(3)333,
25(2)95,
27(1)211,
27(3)255,
28(3)287,
29(1)49,
29(1)75,
30(1)49,
30(2)205,
31(1)73,
32(1)87,
32(3)227,
33(1)107,
33(1)z,
33(2)195,
34(1)33,
34(1)83