Entry Habel:1991:DBP 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{Habel:1991:DBP,
author = "A. Habel and H.-J. Kreowski and W. Vogler",
title = "Decidable boundedness problems for sets of graphs
generated by hyperedge-replacement",
journal = j-THEOR-COMP-SCI,
volume = "89",
number = "1",
pages = "33--62",
day = "21",
month = oct,
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); C4210 (Formal
logic)",
corpsource = "Fachbereich Math. und Inf., Bremen Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "boundedness problem; cyclic bandwidth; decidability;
decidable; grammars; graph theory;
hyperedge-replacement graph grammars; k-trees;
language; nodes; numeric function; outerplanar graphs;
series-parallel graphs; simple paths",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boundedness,
100(2)347,
114(1)93,
126(1)113,
134(2)365
- cyclic,
70(2)261,
100(1)105,
114(1)93,
123(1)3,
125(1)149,
125(2)205,
134(1)209
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- decidable,
71(3)281,
74(1)3,
77(1)73,
78(2)347,
79(1)37,
79(1)263,
80(2)303,
81(1)137,
82(1)19,
88(2)325,
91(1)71,
94(1)1,
94(2)367,
95(1)115,
98(2)199,
103(1)39,
103(1)143,
106(1)135,
108(2)237,
109(1)83,
118(2)167,
120(2)229,
123(2)315,
126(1)113,
127(1)149,
129(2)419,
131(2)271,
131(2)431,
132(1)37,
132(1)129,
134(2)365
- generated,
71(3)281,
83(2)205,
85(1)33,
87(2)315,
100(2)267,
134(1)189
- hyperedge-replacement,
109(1)83,
110(1)145
- node,
70(3)305,
73(3)279,
80(2)153,
82(1)95,
84(2)281,
84(2)293,
90(1)185,
93(2)245,
116(2)359,
127(2)199,
128(1)241
- outerplanar,
71(3)401
- 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)33,
88(1)151,
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
- replacement, hyperedge-,
109(1)83,
110(1)145
- simple,
70(2)179,
71(2)177,
71(2)193,
82(1)151,
86(1)35,
87(1)25,
87(1)81,
88(1)15,
102(2)215,
102(2)283,
103(2)273,
103(2)387,
112(2)215,
112(2)391,
114(2)317,
117(1)99,
119(2)293
- Vogler, W.,
91(2)205