On the Coding of Ordered Graphs

Computing (Vienna/New York)

Volumn 61, Issue 1, 1998, Pages 23-38

  Jiang, X ^a   Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Graph coding; Graph isomorphism; Ordered graph; Polynomial algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

ISOMORPHISM; ORDERED GRAPHS;

ENCODING (SYMBOLS);

EID: 1842866924     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684448     Document Type: Article

References (11)

1. Gati G.: Further annotated bibliography on the isomorphism disease. J. Graph Theory 3, 95-109 (1979).
2. Hopcroft, J. E., Tarjan, R. E.: A VlogV algorithm for isomorphism of triconnected planar graphs. J. Comput. Syst. Sci. 7, 323-331 (1973).
3. 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.
4. Jiang, X., Bunke, H.: Optimal quadratic-time isomorphism of ordered graphs. Technical Report, Department of Computer Science, University of Bern, 1997.
5. Luks, E. M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25, 42-65 (1982).
6. 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.
7. Read, R. C., Cornell, D. G.: The graph isomorphism disease. J. Graph Theory 1, 339-363 (1977).
8. Schöning, U.: Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci. 37, 312-323 (1988).
9. Ullmann, J. R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23, 31-42 (1976).
10. Weinberg, L.: Plane representations and codes for planar graphs. Proc. of Third Annal Allerton Conf. on Circuit and System Theory, pp. 733-744, 1965.
11. Weinberg, L.: A simple and efficient algorithm for determining isomorphism of planar triply connected graphs. IEEE Trans. Circuit Theory 13, 142-148 (1966).