Login / Signup
Reachability in K_{3, 3}-free Graphs and K_5-free Graphs is in Unambiguous Log-Space.
Fabian Wagner
Thomas Thierauf
Published in:
Electron. Colloquium Comput. Complex. (2009)
Keyphrases
</>
directed graph
graph matching
graph theoretic
structured objects
real time
neural network
learning algorithm
video sequences
bipartite graph
graph structure
graph representation
graph clustering
series parallel
graph isomorphism
spectral decomposition