Entry Gavril:1987:GMS 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{Gavril:1987:GMS,
author = "F{\u{a}}nic{\u{a}} Gavril",
title = "Generating the maximum spanning trees of a weighted
graph",
journal = j-J-ALG,
volume = "8",
number = "4",
pages = "592--597",
month = dec,
year = "1987",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/0196-6774(87)90053-8",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:14:39 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0196677487900538",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
Related entries
- generating,
2(3)227,
4(1)61,
5(1)22,
5(2)247,
5(2)281,
7(4)463,
11(1)68,
11(2)185,
13(3)414,
17(2)222,
21(1)176,
25(2)321,
26(2)275,
46(1)21,
54(1)115,
64(1)16
- maximum,
2(1)88,
4(2)121,
4(4)310,
6(1)10,
7(3)425,
10(4)557,
13(1)161,
15(3)416,
16(3)431,
17(3)447,
17(3)475,
21(2)415,
22(1)57,
24(1)177,
25(1)1,
29(1)132,
34(2)337,
36(1)63,
40(2)159,
41(1)99,
46(2)140,
50(1)23,
54(1)105
- spanning,
1(1)51,
2(1)77,
4(3)214,
7(1)105,
8(2)260,
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
- weighted,
2(2)198,
2(4)328,
6(4)550,
7(3)358,
9(3)401,
14(3)478,
16(3)431,
17(2)280,
20(1)87,
22(1)187,
24(1)177,
34(1)90,
39(2)223,
47(2)63,
50(1)49,
58(1)1,
60(1)24