{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:29:13Z","timestamp":1760369353316,"version":"3.41.0"},"reference-count":39,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7840706","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T21:46:59Z","timestamp":1486504019000},"page":"1048-1055","source":"Crossref","is-referenced-by-count":3,"title":["Three-hop distance estimation in social graphs"],"prefix":"10.1109","author":[{"given":"Pascal","family":"Welke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Markowetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Suel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Christoforaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"ref38","article-title":"Compressed representation of web and social networks via dense subgraphs","author":"hern\u00e1ndez","year":"2012","journal-title":"SPIRE"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75530-2_11"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2002.999950"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2001.917152"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063747"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_10"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/060670511"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.11.001"},{"key":"ref15","article-title":"Graph distances in the streaming model: the value of space","author":"feigenbaum","year":"2005","journal-title":"SODA"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22351-8_16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_6"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1145\/1247480.1247573","article-title":"Fast and practical indexing and querying of very large graphs","author":"tri\u00dfl","year":"2007","journal-title":"SIGMOD"},{"key":"ref3","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"SODA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2001.917151"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref2","article-title":"Reach for a*: Effcient point-to-point shortest path algorithms","author":"goldberg","year":"2005","journal-title":"Microsoft Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761110"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568322"},{"key":"ref21","article-title":"A sketch-based distance oracle for web-scale graphs","author":"das","year":"2010","journal-title":"WSDM"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004250"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"}],"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\/07840706.pdf?arnumber=7840706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T03:03:13Z","timestamp":1749956593000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7840706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7840706","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}