Graph-Walking Automata: From Whence They Come, and Whither They are Bound.
Alexander OkhotinPublished in: CIAA (2019)
Keyphrases
- upper bound
- lower bound
- random walk
- graph structure
- cellular automata
- graph model
- graph theory
- graph representation
- worst case
- graph based algorithm
- finite state
- directed acyclic graph
- weighted graph
- error bounds
- connected components
- bipartite graph
- finite state machines
- graph partitioning
- finite automata
- dependency graph
- markov chain