Optimal Vertex Ordering of Graphs
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[2] V. Whitney. Algorithm 422: minimal spanning tree [H] , 1972, CACM.
[3] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..
[4] Andrew Chi-Chih Yao,et al. An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[5] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[6] Donald B. Johnson,et al. Priority Queues with Update and Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[7] R. V. Slyke,et al. Computing minimum spanning trees efficiently , 1972, ACM Annual Conference.
[8] D. Barnette. Trees in Polyhedral Graphs , 1966, Canadian Journal of Mathematics.
[9] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[10] R. Prim. Shortest connection networks and some generalizations , 1957 .
[11] Selim G. Akl,et al. Design and analysis of parallel algorithms , 1985 .
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Michael J. Quinn,et al. Parallel graph algorithms , 1984, CSUR.