{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:27:43Z","timestamp":1758274063894,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7840599","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T21:46:59Z","timestamp":1486504019000},"page":"142-149","source":"Crossref","is-referenced-by-count":1,"title":["The self-avoiding walk-jump (SAWJ) algorithm for finding maximum degree nodes in large graphs"],"prefix":"10.1109","author":[{"given":"Jonathan","family":"Stokes","sequence":"first","affiliation":[]},{"given":"Steven","family":"Weber","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2000172.2000178"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2318857.2254795","article-title":"Beyond random walk and Metropolis-Hastings samplers","volume":"40","author":"lee","year":"2012","journal-title":"ACM Performance Evaluation Review"},{"journal-title":"Finite Markov Chains","year":"1983","author":"kemeny","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.89.208701"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88146-1","author":"kolaczyk","year":"2009","journal-title":"Statistical Analysis of Network Data Methods and Models"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"article-title":"Stanford Large Network Dataset Collection (SNAP)","year":"2014","author":"leskovec","key":"ref12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(86)90057-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129111"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.09.012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3184-9"},{"key":"ref1","article-title":"On random walks and random sampling to find max degree nodes in assortative Erdós Rényi graphs","author":"stokes","year":"2016","journal-title":"IEEE Global Communications Conference"}],"event":{"name":"2016 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2016,12,5]]},"location":"Washington DC,USA","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818133\/7840573\/07840599.pdf?arnumber=7840599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T11:18:37Z","timestamp":1568805517000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7840599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7840599","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}