Transitions in geometric minimum spanning trees
- 1 August 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 8 (3) , 265-293
- https://doi.org/10.1007/bf02293049
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Parametric stable marriage and minimum cutsInformation Processing Letters, 1989
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Clustering algorithms based on minimum and maximum spanning treesPublished by Association for Computing Machinery (ACM) ,1988
- The 1-steiner tree problemJournal of Algorithms, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- New upper bounds for neighbor searchingInformation and Control, 1986
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Voronoi diagrams based on convex distance functionsPublished by Association for Computing Machinery (ACM) ,1985
- Parametric Combinatorial Computing and a Problem of Program Module DistributionJournal of the ACM, 1983