Span-program-based quantum algorithms for graph bipartiteness and connectivity.

Published in: CoRR (2015)

Keyphrases

graph theory
learning algorithm
depth first search
worst case
connected components
orders of magnitude
strongly connected
partitioning algorithm
theoretical analysis
computationally efficient
random walk
computational complexity
graph model
graph partitioning
graph data
significant improvement
objective function