Shortest Paths in the Tower of Hanoi Graph and Finite Automata.
Dan RomikPublished in: SIAM J. Discret. Math. (2006)
Keyphrases
- finite automata
- shortest path
- finding the shortest path
- weighted graph
- shortest path problem
- flow graph
- path length
- strongly connected components
- edge weights
- minimum cut
- shortest path algorithm
- regular expressions
- deterministic automata
- betweenness centrality
- grammatical inference
- road network
- tree automata
- random walk
- travel time
- directed graph
- minimal surface
- finite automaton
- graph partitioning
- graph structure
- geodesic distance
- graph model
- directed acyclic graph
- graph theory
- dynamic programming
- optimal path
- database
- spanning tree
- maximum flow
- graph databases
- information flow
- minimum cost flow
- lower bound
- metadata