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

  title={Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition},
  author={Angela Y. Wu and Azriel Rosenfeld},
  journal={Inf. Control.},
  • A. Wu, A. Rosenfeld
  • Published 1 September 1979
  • Mathematics, Computer Science
  • Inf. Control.

Graph Automata for Linear Graph Languages

Finite graph automata recognize exactly the set of graph languages generated by connected linear NCE graph grammars.

Hyperbolic Recognition by Graph Automata

Graph automata were first introduced by P. Rosenstiehl under the name of intelligent graphs, surely because a network of finite automata is able to know some properties about its own structure, and this hypothesis seems to be absolutely essential for the modelisation of the physical reality.

Recognition of Graphs by Automata

  • Éric Rémila
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1994

Cellular d-graph automata with augmented memory

Sequential and cellular graph automata

Intrinsic Simulations and Universality in Automata Networks

A theory of intrinsic simulations and universality for families of automata networks is developed and a short proof that the family of networks were each node obeys the rule of the ’game of life’ cellular automaton is strongly universal is given.

On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks

A proof technique based on an operation of glueing of networks, which allows to produce complex orbits in large networks from compatible pseudo-orbits in small networks, is developed.

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition

This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both

On the impact of treewidth in the computational complexity of freezing dynamics

This paper establishes how treewidth and maximum degree of the underlying graph are key parameters which influence the overall computational complexity of finite freezing automata networks and establishes the hardness result with a fixed set-defiend update rule that is universally hard on any input graph of such families.

Dynamic Neighbourhood Cellular Automata

It is suggested that Dynamic Neighbourhood Cellular Automata can serve as a theoretical model for studying Algorithmic and Computational Complexity issues in the are of Ubiquitous Computing.



Cellular Graph Automata

  • A. WuA. Rosenfeld
  • Computer Science
    Graph-Grammars and Their Application to Computer Science and Biology
  • 1978
It can be shown that a cellular d-graph automaton can measure various properties of its underlying graph; can detect graph or subgraph isomorphism; and can recognize various basic types of graphs.

Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties

Non-Separable and Planar Graphs.

  • H. Whitney
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1931
A dual of a graph is defined by combinatorial means, and the paper ends with the theorem that a necessary and sufficient condition that a graph be planar is that it have a dual.

Efficient Planarity Testing

An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.

On the Topological Properties of Quantized Spaces, II. Connectivity and Order of Connectivity

A notion of equivalence (c-equivalence) is defined as the counterpart of homeoinorphism for quantized spaces. It is shown that sets with the same number of components and holes are c-equivalent in

On the Topological Properties of Quantized Spaces, I. The Notion of Dimension

The notion of dimension is introduced through a recursive definition and it is proven that for free Abelian groups it equals the number of generators.

Sur le probl ~ me des courbes gauches en topologie , Fund

  • 1930

Efficient planarity testing, jr Assoc

  • 1974