Buchin, K. et al. 2010. Finding the Most Relevant Fragments in Networks. Journal of Graph Algorithms and Applications. 14, 2 (Jan. 2010), 307–336. DOI:https://doi.org/10.7155/jgaa.00209.