Login / Signup
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs.
Beate Bollig
Published in:
STACS (2003)
Keyphrases
</>
theoretical analysis
data driven
structured data
computational complexity
connected components
random walk
directed graph
graph theory
worst case
weighted graph
directed acyclic graph
graph theoretic
machine learning
spanning tree
graph mining
graph structure
search algorithm