Entry Lengauer:1987:EAF from jalg.bib
Last update: Sat Oct 14 02:35:45 MDT 2017
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{Lengauer:1987:EAF,
author = "T. Lengauer",
title = "Efficient algorithms for finding minimum spanning
forests of hierarchically defined graphs",
journal = j-J-ALG,
volume = "8",
number = "2",
pages = "260--284",
month = jun,
year = "1987",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/0196-6774(87)90042-3",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:14:36 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0196677487900423",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
Related entries
- efficient,
4(2)121,
5(1)80,
5(2)281,
6(4)455,
6(4)577,
7(1)105,
8(1)39,
8(2)192,
9(1)47,
9(2)254,
10(4)518,
11(1)132,
12(1)57,
12(3)409,
13(1)2,
13(1)128,
13(3)394,
14(2)171,
14(2)244,
16(3)453,
18(2)203,
19(1)116,
20(1)20,
20(2)375,
20(3)445,
20(3)602,
21(2)331,
21(2)358,
22(1)1,
23(1)180,
23(2)386,
25(1)144,
26(1)166,
26(2)370,
28(2)315,
34(1)90,
34(1)109,
34(2)337,
35(1)122,
37(2)283,
38(1)110,
38(2)354,
38(2)374,
39(2)205,
41(1)41,
41(2)212,
41(2)360,
41(2)443,
43(1)51,
47(2)63,
48(1)194,
50(1)106,
52(1)1,
52(1)82,
54(2)205,
58(6)27,
59(2)107,
60(2)85
- finding,
1(3)235,
2(1)88,
2(1)105,
2(4)337,
3(3)245,
4(1)35,
4(1)61,
4(4)303,
4(4)310,
4(4)324,
4(4)345,
5(2)180,
5(3)422,
6(1)17,
6(1)132,
6(2)265,
6(3)359,
6(4)478,
7(2)258,
7(3)382,
8(3)362,
9(2)181,
9(2)276,
9(3)299,
9(4)470,
9(4)507,
10(1)76,
10(1)109,
11(4)523,
12(1)1,
12(1)38,
12(3)431,
13(2)235,
13(4)636,
14(3)344,
15(3)416,
17(3)424,
18(1)1,
18(2)203,
18(3)378,
20(3)445,
23(2)281,
24(2)310,
24(2)380,
25(2)311,
27(2)269,
28(1)125,
31(1)249,
32(1)21,
32(1)31,
33(1)124,
34(2)203,
34(2)337,
35(2)169,
35(2)235,
36(2)253,
37(2)505,
39(1)1,
46(2)140,
49(1)13,
50(2)134,
50(2)246,
51(2)107,
58(1)1
- forest,
13(1)33,
15(1)173,
15(2)324,
20(3)602,
39(1)1
- Lengauer, T.,
5(3)408
- minimum,
1(1)51,
4(3)282,
8(4)480,
9(3)299,
12(1)38,
13(1)33,
13(2)297,
13(3)374,
14(1)115,
15(1)125,
15(1)173,
15(2)267,
17(2)237,
17(3)424,
19(1)116,
19(2)173,
19(3)383,
21(3)520,
23(2)375,
24(1)171,
27(2)303,
28(1)105,
28(2)197,
28(2)272,
28(2)339,
29(2)204,
33(1)51,
33(1)92,
33(1)112,
33(2)244,
38(1)170,
38(2)411,
41(1)1,
41(2)330,
42(2)255,
44(2)359,
48(1)220,
48(2)385,
51(2)107,
56(2)77,
59(1)1,
60(1)24
- spanning,
1(1)51,
2(1)77,
4(3)214,
7(1)105,
8(4)592,
9(4)507,
10(2)271,
13(1)33,
15(1)173,
17(2)237,
19(3)383,
24(1)171,
24(2)310,
27(2)170,
28(1)105,
29(1)132,
32(1)21,
32(1)31,
33(1)92,
33(2)244,
34(1)177,
36(2)182,
38(2)411,
39(1)1,
41(1)1,
44(2)359,
48(1)220,
48(2)441