Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection
暂无分享,去创建一个
[1] Donald B. Johnson,et al. Priority Queues with Update and Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[2] Andrew Chi-Chih Yao,et al. An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] H. Bunke,et al. Determining the symmetry of polyhedra , 1992 .
[5] Horst Bunke,et al. Detektion von Symmetrien polyedrischer Objekte , 1990, DAGM-Symposium.
[6] D. Barnette. Trees in Polyhedral Graphs , 1966, Canadian Journal of Mathematics.
[7] Selim G. Akl,et al. Design and analysis of parallel algorithms , 1985 .
[8] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..
[9] Michael J. Quinn,et al. Parallel graph algorithms , 1984, CSUR.
[10] V. Whitney. Algorithm 422: minimal spanning tree [H] , 1972, CACM.
[11] Horst Bunke,et al. Recognizing 3-D objects in needle maps , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.
[12] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[13] H. Bunke,et al. Recognition Of Overlapping Objects Using Interpretation Tree Search And Egi Matching , 1990, Optics & Photonics.
[14] R. V. Slyke,et al. Computing minimum spanning trees efficiently , 1972, ACM Annual Conference.
[15] R. Prim. Shortest connection networks and some generalizations , 1957 .