A probabilistic minimum spanning tree algorithm

DOI10.1016/0020-0190(78)90039-XMaRDI QIDQ1241278zbMATH OpenFDO

Authors F. James Rohlf

Publication date 1978

Published in Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3569817 (Why is no real title available?)
• scientific article; zbMATH DE number 3569833 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3448387 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• Finding nearest neighbours
• Preserving order in a forest in less than logarithmic time and linear space
• Priority queues with update and finding minimum spanning trees

Cited in

(5)

• Expected-time complexity results for hierarchic clustering algorithms which use cluster centres
• Efficient algorithms for agglomerative hierarchical clustering methods
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• SPECIALIZED MEASURES OF LEAF OUTLINES AND HIERARCHICAL PERCEPTRONS IN AN AUTOMATIC IDENTIFICATION OF PLANTS
• From lattice long-range percolation to the continuum one.

This page was built for publication: A probabilistic minimum spanning tree algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241278)