Buchin, K. (2010) “Finding the Most Relevant Fragments in Networks”, Journal of Graph Algorithms and Applications, 14(2), pp. 307–336. doi: 10.7155/jgaa.00209.