Entry Miyano:1991:CLF from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Miyano:1991:CLF,
author = "S. Miyano",
title = "{$\Delta_2^P$}-complete lexicographically first
maximal subgraph problems",
journal = j-THEOR-COMP-SCI,
volume = "88",
number = "1",
pages = "33--57",
day = "30",
month = sep,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ.,
Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; connected graphs; directed
graphs; graph property; graph theory; lexicographically
first maximal subgraph problems; LFM induced path
problem; LFM rooted tree problem; polynomial-time
testable; time complexity; topologically sorted
directed acyclic graphs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acyclic,
75(3)357,
78(2)363,
86(1)81,
86(1)z,
92(1)181,
92(1)z,
94(1)63,
95(2)245,
110(1)197,
119(2)331,
123(2)389
- complete,
70(1)127,
70(2)233,
71(3)347,
72(2)265,
74(1)3,
75(1)85,
75(1)z,
75(3)357,
76(2)179,
80(2)203,
81(1)1,
83(2)337,
85(1)75,
87(1)1,
88(1)83,
89(2)207,
91(1)101,
94(2)281,
96(2)305,
97(2)183,
98(1)27,
98(1)z,
100(2)365,
102(1)135,
104(2)263,
111(1)125,
111(1)z,
112(2)255,
114(1)63,
114(2)231,
118(2)167,
118(2)315,
119(1)127,
119(1)z,
120(1)83,
121(1)351,
122(1)97,
124(1)1,
129(2)309,
130(1)203,
131(1)95,
131(2)311,
132(1)229,
133(2)205,
134(1)27,
136(2)487,
136(2)507
- complete, -,
114(2)231,
118(2)315
- connected,
85(2)253,
90(1)171,
95(2)263,
109(1)83,
112(2)215,
134(2)455
- directed,
72(2)97,
72(2)z,
75(1)157,
77(1)195,
77(3)267,
78(2)363,
82(2)177,
94(1)63,
95(2)245,
110(1)197,
117(1)67,
119(1)39,
119(2)331,
123(2)389,
124(2)329,
127(1)187,
127(2)287,
127(2)333
- first,
70(1)127,
74(1)37,
76(2)343,
79(2)295,
87(1)81,
88(1)183
- induced,
93(1)43,
103(1)51,
131(1)181
- lexicographically,
88(1)183
- maximal,
70(1)73,
84(1)53,
87(1)209,
88(1)59,
88(2)325,
89(2)207,
92(1)145,
92(1)191,
95(2)245,
101(2)239,
108(1)173,
108(2)345,
112(2)419,
122(1)49,
134(1)209,
134(1)225
- path,
72(2)251,
72(2)z,
74(2)199,
74(3)355,
79(1)151,
79(1)179,
83(2)189,
84(1)127,
84(2)179,
84(2)281,
88(1)151,
89(1)33,
94(1)141,
95(2)245,
100(1)243,
102(2)329,
105(1)129,
106(2)391,
112(2)255,
115(2)351,
116(2)359,
117(1)137,
117(1)187,
117(1)203,
125(2)345,
127(2)395,
131(1)1,
133(1)65
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- rooted,
106(1)61,
117(1)45
- sorted,
72(2)133,
89(1)3,
93(2)201,
105(2)217
- testable,
84(2)225,
88(1)99
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- topologically,
94(2)367,
119(2)293