论文信息 - The Minimum Spanning Tree Problem on a Planar Graph - 字舞流文

The Minimum Spanning Tree Problem on a Planar Graph

In this paper, we propose a linear time algorithm for nding a minimum spanning tree on a planar graph.

[1] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2] Ronald L. Graham,et al. On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[3] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[4] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[5] Frank Harary,et al. Graph Theory , 2016 .

[6] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .

[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8] R. Prim. Shortest connection networks and some generalizations , 1957 .

[9] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[10] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.