WG 1991: Graph-Theoretic Concepts in Computer Science pp 148-158 | Cite as
Optimal vertex ordering of a graph and its application to symmetry detection
Conference paper
First Online:
Abstract
We consider in this paper the problem of optimal vertex ordering of a graph. The vertex ordering and an optimality measure are defined. It is proved that the optimal ordering problem can be transformed into the well-known minimum-weight spanning tree problem. Some properties of optimal vertex orderings are investigated. And finally, the application of the optimal vertex ordering technique to an algorithm for detecting the symmetry of polyhedra is discussed in some detail.
Keywords
Span Tree Planar Graph Minimum Span Tree Tree Representation Complete Bipartite Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]S. G. Akl, The design and analysis of parallel algorithms, Prentice Hall, 1989.Google Scholar
- [2]D. W. Barnette, Trees in polyhedral graphs, Canad. J. Math., 18, 731–736, 1966.Google Scholar
- [3]D. Cheriton, R. E. Tarjan, Finding minimum spanning-trees, SIAM J. on Comput., 5 (4), 724–742, 1976.Google Scholar
- [4]E. W. Dijkstra, An note on two problems in connection with graphs, Numerische Mathematik, 1 (5), 269–271, 1959.CrossRefGoogle Scholar
- [5]H. N. Gabow, Two algorithms for generating weighted spanning trees in order, SIAM J. on Comput, 6, 139–150, 1977.Google Scholar
- [6]B. Grünbaum, Convex polytopes, Interscience Publishers, 1967.Google Scholar
- [7]B. Grünbaum, Polytopal graphs, in D. R. Fulkerson (Ed.), Studies in graph theory, The Mathematical Association of America, 201–224, 1975.Google Scholar
- [8]X. Y. Jiang, H. Bunke, Recognition of overlapping convex objects using interpretation tree search and EGI matching, Proc. of SPIE Conf. on Applications of Digital Image Processing XII, Vol. 1153, San Diego, 611–620, 1989.Google Scholar
- [9]X. Y. Jiang, H. Bunke, Determining symmetry of polyhedra, Proc. of Int. Workshop on Visual Form, Capri, Italy, 1991.Google Scholar
- [10]X. Y. Jiang, H. Bunke, Detektion von Symmetrien polyedrischer Objekte, in R. E. Grosskopf (Ed.), Mustererkennung 1990, Proc. of 12th German Pattern Recognition Symposium (DAGM), Informatik Fachberichte 254, Springer-Verlag, 225–231, 1990.Google Scholar
- [11]X. Y. Jiang, H. Bunke, Recognizing 3-D objects in needle maps, Proc. of 10th Int. Conf. on Pattern Recognition, Atlantic City, New Jersey, 237–239, 1990.Google Scholar
- [12]D. B. Johnson, Priority queues with update and minimum spanning trees, Inf. Process. Lett, 4, 53–57, 1975.Google Scholar
- [13]A. Kershenbaum, R. Van Slyke, Computing minimum spanning trees efficiently, Proc. Ass. Comput. Math. Conf., 517–528, 1972.Google Scholar
- [14]V. Kevin, M. Whitney, Algorithm 422 — Minimal spanning tree, CACM, 15, 273–274, 1972.Google Scholar
- [15]J. B. Kruskal Jr., On the shortest spanning sub-tree and the traveling salesman problem, Proceedings of Annual ACM Conference, 518–527, 1956.Google Scholar
- [16]R. C. Prim, Shortest connection networks and some generalisations, Bell System Tech. J., 36, 1389–1401, 1957.Google Scholar
- [17]M. J. Quinn, N. Deo, Parallel graph algorithms, Computing Surveys, 16 (3), 319–348, 1984.Google Scholar
- [18]A. C. Yao, An O(¦E¦log log ¦V¦) algorithm for finding minimum spanning tree, Inf. Process. Lett., 4, 21–23, 1975.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1992