Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs.

Published in: RAIRO Theor. Informatics Appl. (2003)

Keyphrases

theoretical analysis
random walk
structured data
complexity analysis
graph theory
graph representation
graph model
bipartite graph
graph structure
polynomial time complexity
computational complexity
graph theoretic
data driven
undirected graph
finite state
weighted graph
directed graph
worst case