Разапињуће стабло минималног степена (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Разапињуће стабло минималног степена" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

low place

451^st place

838^th place

1,983^rd place

2,641^st place

1,185^th place

1,193^rd place

acm.org (Global: 1,185^th place; Serbian: 1,193^rd place)

Pettie, Seth; Ramachandran, Vijaya (2002), „Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms”, Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco, California, стр. 713—722 .

Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), „A randomized linear-time algorithm to find minimum spanning trees”, Journal of the Association for Computing Machinery, 42 (2): 321—328, MR 1409738, doi:10.1145/201019.201022
Chazelle, Bernard (2000), „A minimum spanning tree algorithm with inverse-Ackermann type complexity”, Journal of the Association for Computing Machinery, 47 (6): 1028—1047, MR 1866456, doi:10.1145/355541.355562 .
Chazelle, Bernard (2000), „The soft heap: an approximate priority queue with optimal error rate”, Journal of the Association for Computing Machinery, 47 (6): 1012—1027, MR 1866455, doi:10.1145/355541.355554 .

Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), „A randomized linear-time algorithm to find minimum spanning trees”, Journal of the Association for Computing Machinery, 42 (2): 321—328, MR 1409738, doi:10.1145/201019.201022
Chazelle, Bernard (2000), „A minimum spanning tree algorithm with inverse-Ackermann type complexity”, Journal of the Association for Computing Machinery, 47 (6): 1028—1047, MR 1866456, doi:10.1145/355541.355562 .
Chazelle, Bernard (2000), „The soft heap: an approximate priority queue with optimal error rate”, Journal of the Association for Computing Machinery, 47 (6): 1012—1027, MR 1866455, doi:10.1145/355541.355554 .
Fredman, M. L.; Tarjan, R. E. (1987). „Fibonacci heaps and their uses in improved network optimization algorithms”. Journal of the ACM. 34 (3): 596. doi:10.1145/28869.28874.
Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. (1986). „Efficient algorithms for finding minimum spanning trees in undirected and directed graphs”. Combinatorica. 6 (2): 109. doi:10.1007/bf02579168.

Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), „A randomized linear-time algorithm to find minimum spanning trees”, Journal of the Association for Computing Machinery, 42 (2): 321—328, MR 1409738, doi:10.1145/201019.201022
Chazelle, Bernard (2000), „A minimum spanning tree algorithm with inverse-Ackermann type complexity”, Journal of the Association for Computing Machinery, 47 (6): 1028—1047, MR 1866456, doi:10.1145/355541.355562 .
Chazelle, Bernard (2000), „The soft heap: an approximate priority queue with optimal error rate”, Journal of the Association for Computing Machinery, 47 (6): 1012—1027, MR 1866455, doi:10.1145/355541.355554 .