{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:13:30Z","timestamp":1730297610545,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/smc.2016.7844221","type":"proceedings-article","created":{"date-parts":[[2017,2,10]],"date-time":"2017-02-10T10:57:47Z","timestamp":1486724267000},"page":"000066-000069","source":"Crossref","is-referenced-by-count":2,"title":["A fast connected component algorithm based on hub contraction"],"prefix":"10.1109","author":[{"given":"Ye","family":"Deng","sequence":"first","affiliation":[]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yue-jin","family":"Tan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/62.322436"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/181014.181021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1060.0696"},{"key":"ref15","first-page":"343","article-title":"On the evolution of random graphs","volume":"38","author":"erd\u00f6s","year":"1961","journal-title":"Bull Inst Internat Statist"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2007.05.005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2007.08.008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.4626"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060204"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2116117"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/40\/11\/005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/128749.128750"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.acra.2005.08.035"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/03081088508817681"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808735"},{"key":"ref9","first-page":"257","article-title":"Parallel graph algorithms without memory conflicts","author":"hirschberg","year":"0","journal-title":"Proceedings of the 20th Allerton Conference Univ of Illinois Urbana-Champaign Ill 1982 Conference Proceedings"}],"event":{"name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2016,10,9]]},"location":"Budapest, Hungary","end":{"date-parts":[[2016,10,12]]}},"container-title":["2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7830913\/7844217\/07844221.pdf?arnumber=7844221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T17:57:15Z","timestamp":1488391035000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7844221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/smc.2016.7844221","relation":{},"subject":[],"published":{"date-parts":[[2016,10]]}}}