Abstract
Ordered graph and ordered graph isomorphism provide a natural representation of many objects in applications such as computational geometry, computer vision and pattern recognition. In the present paper we propose a coding procedure for ordered graphs that improves an earlier one based on Eulerian circuits of graphs in terms of both simplicity and computational efficiency. Using our coding approach, we show that the ordered graph isomorphism problem can be optimally solved in quadratic time, although no efficient (polynomial-bound) isomorphism algorithm for general graphs exists today. An experimental evaluation demonstrates the superior performance of the new method.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Gati G.: Further annotated bibliography on the isomorphism disease. J. Graph Theory3, 95–109 (1979).
Hopcroft, J. E., Tarjan, R. E.: AVlogV algorithm for isomorphism of triconnected planar graphs. J. Comput. Syst. Sci.7, 323–331 (1973).
Hopcroft, J. E., Wong, J. K.: Linear time algorithm for isomorphism of planar graphs. Proc. of 6th Annual ACM Symposium on Theory of Computing, pp. 172–184, 1974.
Jiang, X., Bunke, H.: Optimal quadratic-time isomorphism of ordered graphs. Technical Report, Department of Computer Science, University of Bern, 1997.
Luks, E. M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci.25, 42–65 (1982).
Read, R. C.: The coding of various kinds of unlabeled trees. In: Graph theory and computing (Read, R.C. ed.), pp. 153–182. New York: Academic Press 1972.
Read, R. C., Corneil, D. G.: The graph isomorphism disease. J. Graph Theory1, 339–363 (1977).
Schöning, U.: Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci.37, 312–323 (1988).
Ullmann, J. R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach.23, 31–42 (1976).
Weinberg, L.: Plane representations and codes for planar graphs. Proc. of Third Annal Allerton Conf. on Circuit and System Theory, pp. 733–744, 1965.
Weinberg, L.: A simple and efficient algorithm for determining isomorphism of planar triply connected graphs. IEEE Trans. Circuit Theory13, 142–148 (1966).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jiang, X., Bunke, H. On the coding of ordered graphs. Computing 61, 23–38 (1998). https://doi.org/10.1007/BF02684448
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02684448