Minimum Spanning Trees
暂无分享,去创建一个
[1] J. Mark Keil,et al. Approximating the Complete Euclidean Graph , 1988, Scandinavian Workshop on Algorithm Theory.
[2] David P. Dobkin,et al. Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[3] Carl Gutwin,et al. The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.
[4] Paul Chew,et al. There is a planar graph almost as good as the complete graph , 1986, SCG '86.
[5] R. Graham,et al. The Shortest-Network Problem , 1989 .
[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[7] David G. Kirkpatrick,et al. A Note on Delaunay and Optimal Triangulations , 1980, Inf. Process. Lett..
[8] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[9] Gautam Das,et al. WHICH TRIANGULATIONS APPROXIMATE THE COMPLETE GRAPH? , 2022 .
[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .