Algorithms for the Sample Mean of Graphs.

Brijnesh J. Jain Klaus Obermayer

Published in: CAIP (2009)

Keyphrases

graph theory
orders of magnitude
computationally efficient
theoretical analysis
learning algorithm
optimization problems
directed graph
data structure
computational complexity
significant improvement
computational cost
knn
computational efficiency
recently developed