K. Buchin, “Finding the Most Relevant Fragments in Networks”, JGAA, vol. 14, no. 2, pp. 307–336, Jan. 2010.