Properties of regular graphs with large girth via local algorithms.

Carlos Hoppen Nicholas C. Wormald

Published in: J. Comb. Theory, Ser. B (2016)

Keyphrases

graph theory
theoretical analysis
computational efficiency
learning algorithm
optimization problems
significant improvement
computational cost
machine learning algorithms
orders of magnitude
times faster
graph properties
computationally efficient
recently developed
representational power