Graph exploration by a deterministic memoryless automaton with pebbles.
Debasish PattanayakAndrzej PelcPublished in: Discret. Appl. Math. (2024)
Keyphrases
- deterministic finite automata
- finite state automaton
- graph theory
- graph structure
- graph representation
- graph theoretic
- black box
- deterministic finite automaton
- pattern matching
- graph matching
- bipartite graph
- directed graph
- random walk
- stable set
- turing machine
- dependency graph
- hybrid automata
- graph mining
- adjacency matrix
- graph databases
- graph model
- search algorithm
- link analysis
- weighted graph
- structured data
- pairwise