Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
UPDATE
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