ODES is a pthreads parallelized exact algorithm to enumerate all maximal sub-graphs of a graph that exceed a specified cutoff density of at least 1/2, even if they overlap.
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.
