Abstract
We consider in this paper the problem of optimal vertex ordering of a graph. The vertex ordering and an optimality measure are denned. 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.
Cite
CITATION STYLE
Jiang, X. Y., & Bunke, H. (1992). Optimal vertex ordering of a graph and its application to symmetry detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 570 LNCS, pp. 148–158). Springer Verlag. https://doi.org/10.1007/3-540-55121-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
