{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:46:59Z","timestamp":1649191619150},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> An algorithm to evaluate\/count all the possible communities of a graph is presented. An associated unrank function is described. An implementation of an existing algorithm to evaluate all the possible partitions of a graph, based on an unrank function, is presented as well. Performance results of the parallelizations of these algorithms obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included. <\/jats:p>","DOI":"10.1142\/s0129626416500067","type":"journal-article","created":{"date-parts":[[2016,6,7]],"date-time":"2016-06-07T09:54:09Z","timestamp":1465293249000},"page":"1650006","source":"Crossref","is-referenced-by-count":1,"title":["Exhaustive Community Enumeration in Parallel"],"prefix":"10.1142","volume":"26","author":[{"given":"Christian","family":"Trefftz","sequence":"first","affiliation":[{"name":"School of Computing, Grand Valley State University, Allendale MI 49401-9403, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugh","family":"McGuire","sequence":"additional","affiliation":[{"name":"School of Computing, Grand Valley State University, Allendale MI 49401-9403, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Kurmas","sequence":"additional","affiliation":[{"name":"School of Computing, Grand Valley State University, Allendale MI 49401-9403, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerry","family":"Scripps","sequence":"additional","affiliation":[{"name":"School of Computing, Grand Valley State University, Allendale MI 49401-9403, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,6,7]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.5.433"},{"key":"p_3","first-page":"1","volume":"3","author":"AKL S.","year":"1996","journal-title":"Nordic Journal of Computing"},{"key":"p_10","first-page":"6","volume":"69","author":"NEWMAN M","year":"2004","journal-title":"Physical Review E"},{"key":"p_12","first-page":"9","volume":"56","author":"PORTER M.","year":"2009","journal-title":"Notices of the AMS"},{"key":"p_15","first-page":"8","volume":"22","author":"SHI J.","year":"2000","journal-title":"IEEE Transactions on"},{"key":"p_16","first-page":"2","volume":"21","author":"STOJMENOVIC I","year":"2006","journal-title":"Emergent and Distributed Systems"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626416500067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:17:43Z","timestamp":1565151463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626416500067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":6,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,6,7]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S0129626416500067"],"URL":"https:\/\/doi.org\/10.1142\/s0129626416500067","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}