Fig. 9
From: Non-backtracking cycles: length spectrum theory and graph mining applications
Runtime comparison. We measure the time it takes to run each distance method on three different random graph models (ER, top; BA, middle; HG, bottom). We investigate the effect of varying three different parameters (number of eigenvalues, left; number of nodes, center; average degree, right). Lines show average, error bars show standard deviation