×

An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees. (English) Zbl 0307.68028


MSC:

68W99 Algorithms in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, Mass. · Zbl 0286.68029
[2] R.E. Tarjan, unpublished.; R.E. Tarjan, unpublished.
[3] Berge, C.; Chouila-Houri, A., (Programming, Games and Transportation Networks (1965), Wiley), 179
[4] Blum, M.; Floyd, R. W.; Pratt, V. R.; Rivest, R. L.; Tarjan, R. E., Time Bounds for Selection, JCSS, 7, 448-461 (1973) · Zbl 0278.68033
[5] A. Schönnage, M. Paterson and N. Pippenger, “Finding the Median”, Theory of Computation Report No. 6, The University of Warwick.; A. Schönnage, M. Paterson and N. Pippenger, “Finding the Median”, Theory of Computation Report No. 6, The University of Warwick. · Zbl 0335.68033
[6] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, Mass.,, section 4.6 · Zbl 0286.68029
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.