Entry Perl:1982:CEL 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{Perl:1982:CEL,
author = "Y. Perl and S. Zaks",
title = "On the complexity of edge labelings for trees",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "1",
pages = "1--16",
month = jul,
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 = "B0250 (Combinatorial mathematics); B0260
(Optimisation techniques); B6210L (Computer
communications); C1160 (Combinatorial mathematics);
C1180 (Optimisation techniques); C4240 (Programming and
algorithm theory); C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Math. and Computer Sci., Bar-Ilan Univ.,
Ramat-Gan, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communications networks; complexity; computational
complexity; computer communications; computer networks;
edge labelings; minimal average distance; minimal
diameter; NP-complete problems; objective functions;
optimisation; polynomial-time algorithms; trees; trees
(mathematics); weights",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- average,
11(3)303,
29(1)1
- 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,
21(1)91,
21(1)99,
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,
21(1)99
- 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)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
- 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(2)189,
19(3)337,
21(1)99,
21(3)255
- C5620,
24(1)1
- complete, NP-,
13(3)295,
16(2)187,
19(1)17,
31(1)125,
12(1)83
- computational,
10(1)1,
10(1)53,
10(1)83,
10(2)171,
10(3)221,
11(1)1,
11(1)71,
11(1)93,
11(3)321,
12(1)97,
12(2)119,
12(2)161,
12(3)255,
12(3)291,
13(3)271,
13(3)295,
14(1)1,
14(1)91,
14(3)227,
14(3)247,
14(3)289,
14(3)337,
15(1)77,
15(2)181,
15(2)201,
15(3)291,
15(3)321,
16(1)25,
16(1)99,
16(2)115,
16(3)279,
17(1)55,
17(2)213,
17(3)303,
18(1)95,
18(1)105,
18(3)259,
19(1)17,
19(1)39,
19(2)161,
19(2)203,
19(3)337,
20(3)323,
21(1)1,
21(1)105,
21(2)179,
21(3)255,
22(1)19,
22(1)195,
22(3)285,
22(3)317,
23(2)171,
23(2)187,
23(3)333,
24(2)123,
24(3)221,
24(3)239,
24(3)279,
24(3)291,
25(2)95,
25(2)193,
26(1)197,
26(3)287,
26(3)327,
27(1)3,
27(3)241,
28(1)111,
28(1)135,
28(3)277,
29(1)123,
30(3)241,
30(3)319,
31(1)41,
31(1)101,
31(1)125,
31(1)175,
32(1)61,
32(1)77,
32(1)157,
32(1)173,
32(1)221,
32(3)227,
32(3)279,
33(1)117,
33(2)261,
33(2)305,
34(1)17,
34(1)83,
34(1)207,
34(3)337
- computer,
12(1)1,
13(1)17,
17(3)317,
19(1)69,
19(2)143,
22(1)19,
23(2)107,
24(1)1,
25(1)67,
25(2)95,
27(1)225,
32(1)77,
32(1)157,
33(1)z
- edge,
11(1)93,
11(2)145,
18(1)89,
33(1)3
- function,
10(1)1,
10(1)19,
10(1)53,
10(1)63,
10(1)83,
10(2)133,
11(3)321,
11(3)331,
11(3)337,
12(2)161,
12(3)303,
13(3)323,
14(3)247,
15(2)201,
16(2)115,
16(2)177,
16(2)211,
16(2)231,
17(2)163,
18(2)207,
19(3)321,
20(3)323,
21(2)213,
22(1)195,
22(3)317,
23(1)37,
23(3)273,
23(3)287,
23(3)305,
23(3)333,
24(3)221,
24(3)291,
25(2)193,
26(1)105,
26(1)131,
27(1)109,
28(1)111,
28(1)135,
28(1)215,
28(3)239,
28(3)287,
28(3)337,
29(1)1,
29(1)185,
29(3)325,
31(1)41,
31(1)101,
31(1)125,
31(3)227,
32(1)1,
32(1)121,
32(1)173,
33(2)175,
33(2)261
- minimal,
12(3)325,
14(3)289,
16(2)211,
17(1)103,
23(3)305,
30(2)205,
31(1)41
- network,
10(1)19,
10(1)83,
14(1)103,
16(2)177,
18(2)173,
22(1)219,
23(2)107,
24(1)1,
28(3)337,
32(1)157,
32(3)227
- NP-complete,
12(1)83,
13(3)295,
16(2)187,
19(1)17,
31(1)125
- 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(2)189,
19(3)337,
21(1)99,
21(3)255
- polynomial-time,
12(2)161,
21(1)1,
32(3)249,
34(1)207,
34(3)255
- 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(2)189,
19(3)321,
19(3)337,
21(1)99,
21(3)255,
22(1)19,
24(1)1,
31(1)13,
32(1)77,
33(1)117,
33(1)z
- time, polynomial-,
12(2)161,
21(1)1,
32(3)249,
34(1)207,
34(3)255
- tree,
10(1)63,
11(2)181,
11(3)303,
11(3)337,
12(2)175,
12(2)193,
12(3)265,
13(2)175,
13(2)193,
14(1)1,
14(1)79,
16(1)5,
16(2)223,
17(1)91,
17(3)279,
18(2)115,
19(3)253,
20(2)95,
22(1)209,
22(1)219,
22(3)253,
23(2)187,
23(3)231,
23(3)273,
23(3)333,
25(2)95,
27(1)211,
27(3)255,
28(3)287,
29(1)49,
29(1)75,
30(1)49,
30(2)205,
31(1)73,
32(1)87,
32(3)227,
33(1)107,
33(1)z,
33(2)195,
34(1)33,
34(1)83
- weight,
11(3)303
- Zaks, S.,
10(1)63