Limit Set Reachability in Asynchronous Graph Dynamical Systems

DOI10.1007/978-3-642-04420-5_20zbMath1260.68248OpenAlexW1569249995MaRDI QIDQ3646265

V. S. Anil Kumar, Matthew Macauley, Henning S. Mortveit

Publication date: 19 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04420-5_20

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to sequential dynamical systems
• Reachability problems for sequential dynamical systems with threshold functions.
• On some special classes of sequential dynamical systems
• Discrete, sequential dynamical systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• The Structure and Function of Complex Networks

This page was built for publication: Limit Set Reachability in Asynchronous Graph Dynamical Systems