Graph Reachability and Pebble Automata over Infinite Alphabets.
Tony TanPublished in: ACM Trans. Comput. Log. (2013)
Keyphrases
- random walk
- graph representation
- cellular automata
- graph theory
- graph structure
- graph theoretic
- bipartite graph
- graph mining
- stable set
- state space
- graph based algorithm
- transitive closure
- graph model
- weighted graph
- regular expressions
- graph matching
- directed graph
- directed acyclic graph
- finite state machines
- finite state
- graph partitioning
- graphical representation
- regular languages
- connected components
- expressive power