Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
From MaRDI portal
Publication:3859260
DOI10.1016/S0019-9958(79)90296-1zbMath0424.68030OpenAlexW2025500651MaRDI QIDQ3859260
Azriel Rosenfeld, Angela Y. Wu
Publication date: 1979
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90296-1
cellular automatagraph automatadetection of graph or subgraph isomorphismgraph structure recognition
Related Items (9)
Recognition of graphs by automata ⋮ Cellular d-graph automata with augmented memory ⋮ Sequential and cellular graph automata ⋮ Graph automata for linear graph languages ⋮ Algorithms for weighted graph problems on the modified cellular graph automaton ⋮ Expansive automata networks ⋮ Finite graph automata for linear and boundary graph languages ⋮ Network structure and the firing squad synchronization problem ⋮ On simulation in automata networks
This page was built for publication: Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition