{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:50Z","timestamp":1750220630433,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA17124"],"award-info":[{"award-number":["CA17124"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3394231.3397914","type":"proceedings-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T20:24:04Z","timestamp":1592943844000},"page":"241-249","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploring Low-degree nodes first accelerates Network Exploration"],"prefix":"10.1145","author":[{"given":"Stefania","family":"Costantini","sequence":"first","affiliation":[{"name":"Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica Univ. dell'Aquila, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"De Meo","sequence":"additional","affiliation":[{"name":"Universita' degli Studi di Messina, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Giorgianni","sequence":"additional","affiliation":[{"name":"Universita' degli Studi di Messina, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Migliorato","sequence":"additional","affiliation":[{"name":"Universita' degli Studi di Messina, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Provetti","sequence":"additional","affiliation":[{"name":"Birkbeck University of London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Salvia","sequence":"additional","affiliation":[{"name":"Universita' degli Studi di Messina, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of the International Workshop on Combinatorial Algorithms (IWOCA","author":"Abdullah M.","year":"2015","unstructured":"M. Abdullah , C. Cooper , and M. Draief . 2015. Speeding up cover time of sparse graphs using local knowledge . In Proc. of the International Workshop on Combinatorial Algorithms (IWOCA 2015 ). Springer, Verona, Italy, 1\u201312. M. Abdullah, C. Cooper, and M. Draief. 2015. Speeding up cover time of sparse graphs using local knowledge. In Proc. of the International Workshop on Combinatorial Algorithms (IWOCA 2015). Springer, Verona, Italy, 1\u201312."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2015.93"},{"volume-title":"Proc. of the 16th International Conference on World Wide Web, WWW 2007. ACM","author":"Ahn Y.","key":"e_1_3_2_1_3_1","unstructured":"Y. Ahn , S. Han , H. Kwak , S. Moon , and H. Jeong . 2007. Analysis of topological characteristics of huge online social networking services . In Proc. of the 16th International Conference on World Wide Web, WWW 2007. ACM , Banff, Alberta, Canada, 835\u2013844. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong. 2007. Analysis of topological characteristics of huge online social networking services. In Proc. of the 16th International Conference on World Wide Web, WWW 2007. ACM, Banff, Alberta, Canada, 835\u2013844."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01048271"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of the Annual Symposium on Foundations of Computer Science (FOCS","author":"Aleliunas R.","year":"1979","unstructured":"R. Aleliunas , R. Karp , R. Lipton , L. Lov\u00e1sz , and C. Rackoff . 1979. Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems . In Proc. of the Annual Symposium on Foundations of Computer Science (FOCS 1979 ). IEEE Computer Society, San Juan, Puerto Rico, 218\u2013223. R. Aleliunas, R. Karp, R. Lipton, L. Lov\u00e1sz, and C. Rackoff. 1979. Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In Proc. of the Annual Symposium on Foundations of Computer Science (FOCS 1979). IEEE Computer Society, San Juan, Puerto Rico, 218\u2013223."},{"volume-title":"Proc. of the International Symposium on Information Processing in Sensor Networks","author":"Avin C.","key":"e_1_3_2_1_6_1","unstructured":"C. Avin and C. Brito . 2004. Efficient and robust query processing in dynamic environments using random walk techniques . In Proc. of the International Symposium on Information Processing in Sensor Networks . Berkeley, California, 277\u2013286. C. Avin and C. Brito. 2004. Efficient and robust query processing in dynamic environments using random walk techniques. In Proc. of the International Symposium on Information Processing in Sensor Networks. Berkeley, California, 277\u2013286."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_55"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.09.012"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.115"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20504"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1988688.1988749"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01270385"},{"volume-title":"Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Cho E.","key":"e_1_3_2_1_13_1","unstructured":"E. Cho , S. Myers , and J. Leskovec . 2011. Friendship and mobility: user movement in location-based social networks . In Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . San Diego, CA, USA, 1082\u20131090. E. Cho, S. Myers, and J. Leskovec. 2011. Friendship and mobility: user movement in location-based social networks. In Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Diego, CA, USA, 1082\u20131090."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3413"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"S. Costantini G.\u00a0De Gasperis A. Provetti and P. Tsintza. 2013. A heuristic approach to proposal-based negotiation: With applications in fashion supply chain management. Mathematical Problems in Engineering 2013 896312 (2013).  S. Costantini G.\u00a0De Gasperis A. Provetti and P. Tsintza. 2013. A heuristic approach to proposal-based negotiation: With applications in fashion supply chain management. Mathematical Problems in Engineering 2013 896312 (2013).","DOI":"10.1155\/2013\/896312"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.03.012"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060406"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060106"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111011"},{"key":"e_1_3_2_1_20_1","unstructured":"P. Hu and W. Lau. 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865(2013).  P. Hu and W. Lau. 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865(2013)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.020"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01048274"},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"Random walks on graphs","volume":"2","author":"Lov\u00e1sz L.","year":"1993","unstructured":"L. Lov\u00e1sz . 1993 . Random walks on graphs . Combinatorics 2 , 1 (1993), 1 \u2013 46 . L. Lov\u00e1sz. 1993. Random walks on graphs. Combinatorics 2, 1 (1993), 1\u201346.","journal-title":"Combinatorics"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991894"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of the European Computer Vision Conference, ECCV","author":"McAuley J.","year":"2012","unstructured":"J. McAuley and J. Leskovec . 2012. Image Labeling on a Network: Using Social-Network Metadata for Image Classification . In Proc. of the European Computer Vision Conference, ECCV 2012 . Florence, Italy, 828\u2013841. J. McAuley and J. Leskovec. 2012. Image Labeling on a Network: Using Social-Network Metadata for Image Classification. In Proc. of the European Computer Vision Conference, ECCV 2012. Florence, Italy, 828\u2013841."},{"key":"e_1_3_2_1_26_1","volume-title":"A measure of betweenness centrality based on random walks. Social networks 27, 1","author":"Newman M.","year":"2005","unstructured":"M. Newman . 2005. A measure of betweenness centrality based on random walks. Social networks 27, 1 ( 2005 ), 39\u201354. M. Newman. 2005. A measure of betweenness centrality based on random walks. Social networks 27, 1 (2005), 39\u201354."},{"volume-title":"Networks","author":"Newman M.","key":"e_1_3_2_1_27_1","unstructured":"M. Newman . 2018. Networks . Oxford university press . M. Newman. 2018. Networks. Oxford university press."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00124"},{"volume-title":"A guide to first-passage processes","author":"Redner S.","key":"e_1_3_2_1_29_1","unstructured":"S. Redner . 2001. A guide to first-passage processes . Cambridge University Press . S. Redner. 2001. A guide to first-passage processes. Cambridge University Press."},{"volume-title":"A first course in probability","author":"Ross S.","key":"e_1_3_2_1_30_1","unstructured":"S. Ross . 2006. A first course in probability . Pearson Prentice Hall Upper Saddle River , NJ. S. Ross. 2006. A first course in probability. Pearson Prentice Hall Upper Saddle River, NJ."},{"key":"e_1_3_2_1_31_1","unstructured":"B. Rozemberczki C. Allen and R. Sarkar. 2019. Multi-scale Attributed Node Embedding. arXiv preprint arXiv:1909.13021(2019).  B. Rozemberczki C. Allen and R. Sarkar. 2019. Multi-scale Attributed Node Embedding. arXiv preprint arXiv:1909.13021(2019)."},{"volume-title":"Proc. of the 2nd ACM workshop on Online social networks","author":"Viswanath B.","key":"e_1_3_2_1_32_1","unstructured":"B. Viswanath , A. Mislove , M. Cha , and K. Gummadi . 2009. On the evolution of user interaction in Facebook . In Proc. of the 2nd ACM workshop on Online social networks . Barcelona, Spain, 37\u201342. B. Viswanath, A. Mislove, M. Cha, and K. Gummadi. 2009. On the evolution of user interaction in Facebook. In Proc. of the 2nd ACM workshop on Online social networks. Barcelona, Spain, 37\u201342."},{"key":"e_1_3_2_1_33_1","unstructured":"T. Weng J. Zhang M. Small F. Bijarbooneh and P. Hui. 2017. Partial cover time that is sublinear in the number of targets on complex networks: a universal law. arXiv preprint arXiv:1701.03259(2017).  T. Weng J. Zhang M. Small F. Bijarbooneh and P. Hui. 2017. Partial cover time that is sublinear in the number of targets on complex networks: a universal law. arXiv preprint arXiv:1701.03259(2017)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"event":{"name":"WebSci '20: 12th ACM Conference on Web Science","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Southampton United Kingdom","acronym":"WebSci '20"},"container-title":["12th ACM Conference on Web Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394231.3397914","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394231.3397914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:41Z","timestamp":1750197701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394231.3397914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":34,"alternative-id":["10.1145\/3394231.3397914","10.1145\/3394231"],"URL":"https:\/\/doi.org\/10.1145\/3394231.3397914","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}