Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition

This paper deals with cellular automata in which the intercell connections define a graph of bounded degree. It discusses acceptance tasks that involve the detection of graph or subgraph isomorphism in time proportional to the diameter of the given graph. In some of the algorithms, special assumptions are made about the “homogeneity” of the graph; these assumptions hold for many important classes of graphs, including trees and arrays. The paper also examines types of graph structures that can be recognized by these automata. Diameter-time algorithms are presented for the recognition of cycles, strings, trees, cliques, rectangular and square arrays, Eulerian graphs, bipartite and complete bipartite graphs, stars, and wheels. The recognition of planar graphs is also discussed.

[1]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[2]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[3]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[4]  John Mylopoulos,et al.  On the Topological Properties of Quantized Spaces, II. Connectivity and Order of Connectivity , 1971, JACM.

[5]  Azriel Rosenfeld,et al.  Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties , 1979, Inf. Control..

[6]  John Mylopoulos,et al.  On the Topological Properties of Quantized Spaces, I. The Notion of Dimension , 1971, JACM.

[7]  W. Sierpinski,et al.  Sur le probléme des courbes gauches en Topologie , 2022 .

[8]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Azriel Rosenfeld,et al.  Cellular Graph Automata , 1978, Graph-Grammars and Their Application to Computer Science and Biology.