Entry Maier:1984:CAH 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{Maier:1984:CAH,
author = "D. Maier",
title = "Connections in acyclic hypergraphs",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "185--199",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "State Univ. of New York, Stony Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acyclic hypergraphs; acyclic join dependencies;
biconnected components; blocks; connections among
attributes; edge-disjoint paths; equivalence;
equivalence classes; Graham reduction; graph theory;
relational databases; subgraphs without articulation
points; tableau reduction; universal relations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acyclic,
10(2)111,
13(3)315,
18(1)89,
19(1)69,
22(3)233
- biconnected,
19(2)189
- 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)91,
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)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
- class,
10(3)221,
11(3)277,
15(2)181,
16(1)61,
17(2)229,
17(3)333,
18(1)95,
19(1)17,
19(1)29,
23(2)129,
23(2)217,
23(3)231,
23(3)333,
24(1)1,
24(1)53,
26(1)1,
26(1)197,
26(3)287,
27(1)61,
28(1)111,
31(1)73,
31(3)263,
31(3)317,
32(1)87,
32(1)121,
32(3)261,
33(2)239,
33(2)305,
34(1)17,
34(1)83,
34(3)255,
34(3)337
- components,
29(1)87
- database,
10(1)93,
17(3)317,
19(1)69,
19(2)143,
19(3)267,
22(1)175,
23(1)11,
24(2)143,
26(1)149,
26(3)243,
32(1)77,
33(1)95,
33(1)107,
34(1)215,
34(3)315,
34(3)343
- dependency,
10(1)93,
13(1)3,
17(3)317,
19(2)143,
22(1)175,
24(2)143,
24(3)323,
26(1)149,
26(3)243,
33(1)95,
33(1)z,
34(3)315,
34(3)343
- equivalence,
12(3)339,
13(3)239,
13(3)295,
14(2)155,
15(1)1,
15(1)51,
15(2)159,
17(1)55,
17(1)99,
17(2)113,
17(2)163,
17(3)235,
18(3)279,
19(1)17,
19(1)29,
19(3)267,
21(2)231,
22(1)135,
23(2)129,
23(3)231,
24(3)313,
25(2)171,
27(1)3,
29(3)251,
29(3)285,
31(1)49,
31(1)73,
31(1)139,
31(3)297,
32(1)87,
32(1)121,
32(3)261,
33(1)3,
33(2)239,
33(2)305,
34(1)83,
34(3)255
- join,
33(1)95,
33(1)z
- path,
18(2)149,
26(1)25,
26(1)121
- point,
12(3)229,
16(2)211,
18(3)333,
24(1)73,
26(1)53,
29(1)167,
29(3)309,
32(1)215
- reduction,
11(3)341,
14(1)91,
19(1)29,
19(3)287,
21(1)99,
29(3)251,
31(1)151,
32(1)61,
33(2)305,
34(1)17
- relation,
10(1)93,
15(1)51,
16(1)61,
19(3)267,
22(1)71,
24(1)1,
24(1)73,
24(2)143,
24(3)301,
27(1)39,
27(3)311,
29(1)87,
31(1)125,
33(1)95,
33(2)139,
33(2)331,
34(3)343
- relational,
10(1)93,
15(1)1,
15(1)51,
15(2)159,
17(3)317,
19(2)143,
19(3)267,
22(1)175,
24(2)143,
26(1)149,
34(3)315,
34(3)343
- subgraph,
10(2)111,
17(1)91,
19(2)189
- universal,
11(2)167,
16(1)93,
19(2)143,
22(1)19,
23(3)305,
26(3)327