{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T13:12:44Z","timestamp":1658927564884},"reference-count":25,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1093\/comnet\/cnx008","type":"journal-article","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T19:11:34Z","timestamp":1492024294000},"source":"Crossref","is-referenced-by-count":1,"title":["Shortest path tree sampling for landmark selection in large networks"],"prefix":"10.1093","author":[{"given":"Shlomi","family":"Maliah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rami","family":"Puzis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Shani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,6,9]]},"reference":[{"key":"key\n\t\t\t\t20170609045855_B1","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1145\/1458082.1458274","article-title":"Searching the wikipedia with contextual information","volume-title":"Proceedings of the 17th ACM conference on Information and knowledge management","year":"2008"},{"key":"key\n\t\t\t\t20170609045855_B2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/1321440.1321520","article-title":"Efficient search ranking in social networks","volume-title":"Proceedings of the sixteenth ACM conference on Conference on information and knowledge management","year":"2007"},{"key":"key\n\t\t\t\t20170609045855_B3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.14778\/1453856.1453934","article-title":"Efficient network aware search in collaborative tagging sites","volume":"1","year":"2008","journal-title":"Proceedings VLDB Endowment"},{"key":"key\n\t\t\t\t20170609045855_B4","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TKDE.2011.200","article-title":"T-drive: enhancing driving directions with taxi drivers\u2019 intelligence","volume":"25","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"key\n\t\t\t\t20170609045855_B5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","year":"1959","journal-title":"Numerische mathematik"},{"key":"key\n\t\t\t\t20170609045855_B6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","article-title":"Heuristic search viewed as path finding in a graph","volume":"1","year":"1970","journal-title":"Artif Intell"},{"key":"key\n\t\t\t\t20170609045855_B7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jalgor.2003.08.001","article-title":"Compact roundtrip routing in directed networks","volume":"50","year":"2004","journal-title":"J Algorithm"},{"key":"key\n\t\t\t\t20170609045855_B8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/1718487.1718537","article-title":"A sketch-based distance oracle for web-scale graphs","volume-title":"Proceedings of the Third ACM International Conference on Web Search and Data Mining","year":"2010"},{"key":"key\n\t\t\t\t20170609045855_B9","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","year":"2005"},{"key":"key\n\t\t\t\t20170609045855_B10","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1871437.1871503","article-title":"Fast and accurate estimation of shortest paths in large graphs","volume-title":"Proceedings of the 19th ACM International Conference on Information and Knowledge Management","year":"2010"},{"key":"key\n\t\t\t\t20170609045855_B11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/2463676.2465315","article-title":"Fast exact shortest-path distance queries on large networks by pruned landmark labeling","volume-title":"Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data","year":"2013"},{"key":"key\n\t\t\t\t20170609045855_B12","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1145\/1645953.1646063","article-title":"Fast shortest path distance estimation in large networks","volume-title":"Proceedings of the 18th ACM Conference on Information and Knowledge Management","year":"2009"},{"key":"key\n\t\t\t\t20170609045855_B13","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1145\/2063576.2063834","article-title":"Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs","volume-title":"Proceedings of the 20th ACM International Conference on Information and Knowledge Management.","year":"2011"},{"key":"key\n\t\t\t\t20170609045855_B14","first-page":"11","article-title":"A fast algorithm for streaming betweenness centrality","volume-title":"Privacy, Security, Risk and Trust (PASSAT), 2012 International Conference on and 2012 International Confernece on Social Computing (SocialCom)","year":"2012"},{"key":"key\n\t\t\t\t20170609045855_B15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.14778\/2732219.2732225","article-title":"Toward a distance oracle for billion-node graphs","volume":"7","year":"2013","journal-title":"Proceedings VLDB Endowment"},{"key":"key\n\t\t\t\t20170609045855_B16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TC.2008.198","article-title":"Shortest path tree computation in dynamic graphs","volume":"58","year":"2009","journal-title":"IEEE Trans. Comput."},{"key":"key\n\t\t\t\t20170609045855_B17","first-page":"90","article-title":"Better approximation of betweenness centrality","volume-title":"ALENEX","year":"2008"},{"key":"key\n\t\t\t\t20170609045855_B18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","article-title":"The centrality of groups and classes","volume":"23","year":"1999","journal-title":"J. Math. Sociol"},{"key":"key\n\t\t\t\t20170609045855_B19","first-page":"287","article-title":"Finding the most prominent group in complex networks","volume":"20","year":"2007","journal-title":"AI Commun"},{"key":"key\n\t\t\t\t20170609045855_B20","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1016\/j.ipl.2009.07.019","article-title":"Incremental deployment of network monitors based on group betweenness centrality","volume":"109","year":"2009","journal-title":"Inform. Process. Lett."},{"key":"key\n\t\t\t\t20170609045855_B21","first-page":"208701","article-title":"Assortative mixing in networks","volume":"89","year":"2002","journal-title":"Phys. Rev. E"},{"key":"key\n\t\t\t\t20170609045855_B22","doi-asserted-by":"crossref","first-page":"2494","DOI":"10.1109\/TKDE.2015.2419666","article-title":"Scalable online betweenness centrality in evolving graphs","volume":"27","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"key\n\t\t\t\t20170609045855_B23","first-page":"19","article-title":"Submodular function maximization","volume":"vol. 3","year":"2012","journal-title":"Tractability: Practical Approaches to Hard Problems"},{"key":"key\n\t\t\t\t20170609045855_B24","first-page":"2","article-title":"The igraph software package for complex network research","volume":"1695","year":"2006","journal-title":"InterJournal, Complex Systems"},{"key":"key\n\t\t\t\t20170609045855_B25","first-page":"17","article-title":"Using anytime algorithms in intelligent systems","year":"1996","journal-title":"AI magazine"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/doi\/10.1093\/comnet\/cnx008\/17689104\/cnx008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T12:55:45Z","timestamp":1658926545000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnx008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,9]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnx008","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,9]]}}}