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.