Entry Berenguer:1982:SSE 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{Berenguer:1982:SSE,
author = "X. Berenguer and J. Diaz and L. H. Harper",
title = "A solution of the {Sperner-Erd{\H{o}}s} problem",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "99--103",
month = oct,
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 = "B0210 (Algebra); B0250 (Combinatorial mathematics);
B0260 (Optimisation techniques); C1110 (Algebra); C1160
(Combinatorial mathematics); C1180 (Optimisation
techniques)",
corpsource = "Facultat d'Informatica, Univ. Politecnica de
Barcelona, Barcelona, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; combinatorial optimisation;
Erdos; Ford-Fulkerson; Maxflow problem; optimisation;
polynomial reductions; polynomials; Sperner",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algebra,
10(3)221,
12(3)229,
13(1)109,
14(3)305,
15(1)1,
15(1)77,
15(2)159,
15(2)201,
16(1)93,
17(1)99,
17(2)151,
17(3)343,
19(1)39,
20(2)95,
21(1)91,
21(3)281,
21(3)315,
22(1)95,
22(3)317,
23(1)95,
23(2)171,
23(2)187,
24(1)73,
25(1)67,
25(2)171,
27(1)225,
27(3)255,
28(3)287,
30(1)91,
31(1)31,
32(1)1,
32(1)61,
32(1)201,
32(3)279,
33(1)117,
33(2)139,
33(2)327,
33(2)331,
34(1)33,
34(1)169,
34(1)207,
34(3)315
- B0210,
21(1)91
- B0250,
11(1)93,
11(2)117,
13(2)137,
16(1)5,
17(1)29,
17(1)75,
17(1)91,
17(1)103,
17(2)151,
18(1)89,
19(1)1,
21(1)91,
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
- B0260,
19(1)1
- C1110,
16(1)93,
19(1)39,
21(1)91,
22(1)95,
25(1)67,
28(3)287,
32(1)1,
32(1)61,
32(1)201,
32(3)279,
33(2)327,
33(2)331
- 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,
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
- C1180,
10(2)123,
11(1)1,
12(1)83,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(2)189,
19(3)337,
21(3)255
- optimisation,
10(2)123,
11(1)1,
12(1)83,
14(1)79,
14(1)103,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(2)189,
19(3)337,
21(3)255
- 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(1)91,
17(2)163,
18(1)95,
19(1)17,
19(3)287,
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
- reduction,
11(3)341,
14(1)91,
19(1)29,
19(3)287,
29(3)251,
31(1)151,
32(1)61,
32(1)185,
33(2)305,
34(1)17
- solution,
10(2)123,
13(1)61,
13(3)271,
15(1)77,
16(3)329,
19(3)305,
24(1)1,
25(1)67,
30(2)205,
34(1)215
- technique,
10(2)123,
11(1)1,
11(2)145,
12(1)83,
12(3)325,
13(1)61,
13(1)109,
14(1)19,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(2)189,
19(3)321,
19(3)337,
21(3)255,
22(1)19,
24(1)1,
31(1)13,
32(1)77,
33(1)117,
33(1)z