Discovering dense subgraphs and understanding their relations is important. Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been shown to be effective to locate many dense subgraphs. However, constru - Degeneracy - Document - PDFSEARCH.IO

First Page	Meta Content
	Discovering dense subgraphs and understanding their relations is important. Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been shown to be effective to locate many dense subgraphs. However, constru Add to Reading List Document Date: 2016-06-23 15:50:48 Open Document File Size: 11,58 KB Share Result on Facebook

Discovering dense subgraphs and understanding their relations is important. Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been shown to be effective to locate many dense subgraphs. However, construAdd to Reading List