Entry Drewes:1993:RCH 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{Drewes:1993:RCH,
author = "Frank Drewes",
title = "Recognising $k$-connected hypergraphs in cubic time",
journal = j-THEOR-COMP-SCI,
volume = "109",
number = "1--2",
pages = "83--122",
day = "01",
month = mar,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:00 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=109&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=109&issue=1-2&aid=1258",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
conflocation = "Bordeaux, France; 21-23 March 1991",
conftitle = "International Workshop on Computing by Graph
Transformation",
corpsource = "Bremen Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; cubic time; cyclically
connected graphs; decidability; decidable; formal
languages; grammars; graph theory;
hyperedge-replacement grammars; hypergraph languages;
membership problem; split trees; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $k$,
84(2)151,
98(2)163,
116(2)405,
120(2)247,
132(1)209
- connected,
85(2)253,
88(1)33,
90(1)171,
95(2)263,
112(2)215,
134(2)455
- cubic,
84(2)179,
120(2)197
- 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,
89(1)33,
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,
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,
89(1)33,
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,
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
- hyperedge-replacement,
89(1)33,
110(1)145
- hypergraph,
72(2)97,
72(2)z,
78(1)217,
82(2)177,
85(2)253,
101(1)3,
103(2)165,
109(1)123,
109(1)225,
112(2)355,
116(1)151,
132(1)209
- membership,
76(2)223,
78(1)159,
84(2)225,
87(2)287,
92(2)249,
104(2)185,
106(2)327,
111(1)211,
132(1)85,
132(1)243,
134(2)365
- replacement, hyperedge-,
89(1)33,
110(1)145
- split,
106(2)309