Automata on Directed Graphs: Edge Versus Vertex Marking.
Dietmar BerwangerDavid JaninPublished in: ICGT (2006)
Keyphrases
- directed graph
- undirected graph
- disjoint paths
- edge weights
- strongly connected
- random walk
- cellular automata
- directed acyclic graph
- finite automata
- edge detection
- graph structure
- maximum flow
- weighted graph
- edge information
- vertex set
- approximation algorithms
- probability distribution
- connected components
- finite state
- gray scale
- graph structures
- clustering method