Entry Galil:1981:TEV 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{Galil:1981:TEV,
author = "Z. Galil",
title = "On the theoretical efficiency of various network flow
algorithms",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "103--111",
month = apr,
year = "1981",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math. Sci., Tel-Aviv Univ., Tel-Aviv,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; combinatorial mathematics;
combinatorial optimisation; maximal flow; network flow
algorithms; optimisation; theoretical efficiency; time
bounds; topology",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bound,
10(1)1,
10(1)53,
10(1)83,
11(3)321,
12(3)339,
14(1)19,
14(3)337,
15(3)311,
16(3)307,
19(1)39,
22(3)233,
22(3)285,
23(1)95,
23(2)171,
23(2)211,
24(3)239,
25(1)1,
26(1)25,
27(1)3,
27(3)241,
28(3)263,
28(3)337,
29(1)75,
29(1)123,
30(3)319,
32(1)173
- 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,
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)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
- efficiency,
12(3)303
- flow,
15(1)1,
15(1)51,
15(2)159,
21(1)105,
23(2)107,
24(1)1
- Galil, Z.,
13(3)331,
21(1)39
- maximal,
14(3)289,
15(3)279,
16(2)211
- network,
10(1)19,
10(1)83,
16(2)177,
18(2)173,
19(1)1,
22(1)219,
23(2)107,
24(1)1,
28(3)337,
32(1)157,
32(3)227
- optimisation,
10(2)123,
11(1)1,
12(1)83,
14(1)79,
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(1)99,
21(3)255
- theoretical,
33(1)z
- time,
10(2)111,
11(1)93,
12(1)1,
12(2)161,
13(3)295,
14(1)1,
14(1)39,
14(1)91,
15(3)311,
15(3)321,
15(3)329,
16(2)115,
16(2)223,
16(3)329,
17(2)163,
18(1)95,
19(1)17,
20(3)323,
21(1)105,
23(2)107,
23(3)333,
26(1)25,
26(1)197,
26(3)327,
31(1)101,
31(3)297,
32(1)61,
32(1)77,
32(1)157,
32(3)227,
32(3)279,
34(1)17,
34(1)135,
34(1)227,
34(3)255
- topology,
10(2)133,
16(1)5,
24(2)195,
34(3)275