{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:11:46Z","timestamp":1779174706153,"version":"3.51.4"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/bigdata.2014.7004366","type":"proceedings-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T15:04:23Z","timestamp":1421161463000},"page":"9-16","source":"Crossref","is-referenced-by-count":55,"title":["ParK: An efficient algorithm for k-core decomposition on multicore processors"],"prefix":"10.1109","author":[{"given":"Naga Shailaja","family":"Dasari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjan","family":"Desh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zubair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SAAHPC.2011.18"},{"key":"17","article-title":"Graphlab: A new framework for parallel machine learning","author":"low","year":"2010","journal-title":"CoRR"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.10.002"},{"key":"15","first-page":"1695","article-title":"The igraph software package for complex network research","author":"csardi","year":"2006","journal-title":"InterJournal Vol Complex Systems"},{"key":"16","article-title":"Networkit: An interactive tool suite for high-performance network analysis","author":"staudt","year":"2014","journal-title":"CoRR"},{"key":"13","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","article-title":"Listing all maximal cliques in sparse graphs in near-optimal time","author":"eppstein","year":"2010","journal-title":"ISAAC Ser Lecture Notes in Computer Science"},{"key":"14","article-title":"A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components","author":"rossi","year":"2013","journal-title":"CoRR"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1002-991"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2013.6732603"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"24","first-page":"488","article-title":"K-shell decomposition for dynamic complex networks","author":"miorandi","year":"2010","journal-title":"WiOpt"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"26","author":"leskovec","year":"0","journal-title":"Stanford Large Network Dataset Collection"},{"key":"27","author":"madduri","year":"2014","journal-title":"Gtgraph A suite of synthetic graph generators"},{"key":"28","article-title":"Valgrind 3.3-advanced debugging and profiling for gnu\/linux applications","author":"seward","year":"2008","journal-title":"Network Theory Ltd"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.3934\/nhm.2008.3.371"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"10","first-page":"41","article-title":"Large scale networks fingerprinting and visualization using the kcore decomposition","volume":"18","author":"alvarez-hamelin","year":"2006","journal-title":"Advances in neural information processing systems"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-011-0224-z"},{"key":"6","article-title":"Detecting dense communities in large social and information networks with the core &peel algorithm","author":"pellegrini","year":"2012","journal-title":"CoRR"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"4","first-page":"11","article-title":"Medusa-new model of internet topology using k-shell decomposition","author":"carmi","year":"2007","journal-title":"PNAS"},{"key":"9","article-title":"K-core decomposition: A tool for the visualization of large scale networks","author":"alvarez-hamelin","year":"2005","journal-title":"CoRR"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_9"}],"event":{"name":"2014 IEEE International Conference on Big Data (Big Data)","location":"Washington, DC, USA","start":{"date-parts":[[2014,10,27]]},"end":{"date-parts":[[2014,10,30]]}},"container-title":["2014 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6973861\/7004197\/07004366.pdf?arnumber=7004366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T23:34:09Z","timestamp":1498174449000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7004366\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2014.7004366","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}