http://www.cs.purdue.edu/homes/dgleich
Last updated 2012-01-14
This page is a placeholder for a quick Matlab package on computing graph geodesic histograms quickly. A geodesic is a shortest path, and this code implements a Flajolet-Martin counter to quickly estimate the number of geodesics of various lengths in a graph. It is not a novel idea and has been described by Faloustous et al. (2002-ish), and later improved (significantly!) by Boldi et al (HyperANF) (2011-ish).
I’ll be updating the page soon with more detail.
Grab the fast_graph_geodesics.tar.gz code now