A Probabilistic Minimum Spanning Tree Algorithm (1978)


Download Links

by F. James Rohlf
Venue:Information Processing Letters
Citations:5 - 0 self

Active Bibliography

13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
10 Randomized Data Structures for the Dynamic Closest-Pair Problem – Mordecai Golin, Rajeev Raman, Christian Schwarz, Michiel Smid - 1993
1 Optimal Vertex Ordering of a Graph – X.Y. Jiang, H. Bunke - 1990
A Data Structure for Manipulating Priority Queues – S. L. Graham, R. L. Rivest, Jean Vuillemin, Universit De Paris-sud
Note on the structure of Kruskal’s Algorithm – Nicolas Broutin, Luc Devroye, Erin Mcleish - 2007
65 Closest-Point Problems in Computational Geometry – Michiel Smid - 1997
AND – P. J. Flynn
An ERS Model for Tense and Aspect Information . . . – Hsi-Jian Lee, et al. - 1990
1 Computer Society. – A. K. Jain, M. N. Murty, P. J. Flynn, Name Anil, K. Jain, Name M. N. Murty
AND – P. J. Flynn
1284 Data Clustering: A Review – A K Jain, M N Murty, P. J. Flynn - 1999
Graph Based K-Means Clustering – Laurent Galluccio A, Olivier Michel B, Pierre Comon A, Alfred O. Hero Iii D
One of the recurrent problems in pattern recognit... – Laurent Galluccio A, Olivier Michel B, Pierre Comon A, Alfred O. Hero Iii D
560 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
4 Efficient Hierarchical Clustering Algorithms using Partially Overlapping Partitions – Manoranjan Dash, Huan Liu - 2001
9 On Enumerating and Selecting Distances – Timothy M. Chan - 1999
A fast approximation algorithm for minimum spanning trees in k-dimensional space – Pravin M. Vaidya - 1984
1 Automated Selection of Modelling Coordinates for Forward Dynamic Analysis of Multibody Systems – Mathieu Serge Léger
The technical contributions – Jon Louis Bentley, Reader Copyright, Jon Louis Bentley, Ray Finkel, Jerry Friedman, Mike Shames, Don Stanat, Frances Yao - 1976