in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth.

Daniela Kühn Deryk Osthus

Published in: Comb. Probab. Comput. (2004)

Keyphrases

average degree
phase transition
random walk
network size
small world networks
undirected graph
approximation algorithms
neural network
social networks
special case
constraint satisfaction
graph matching
small world
scale free