{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:02:18Z","timestamp":1742922138659,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319988085"},{"type":"electronic","value":"9783319988092"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98809-2_19","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T08:19:34Z","timestamp":1533716374000},"page":"303-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Community Structure Based Shortest Path Finding for Social Networks"],"prefix":"10.1007","author":[{"given":"Yale","family":"Chai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyao","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojie","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"issue":"2","key":"19_CR1","first-page":"253","volume":"29","author":"L Chang","year":"2016","unstructured":"Chang, L., Li, W.: pSCAN: Fast and exact structural graph clustering. ICDE 29(2), 253\u2013264 (2016)","journal-title":"ICDE"},{"issue":"1","key":"19_CR2","first-page":"114","volume":"1","author":"M Gong","year":"2016","unstructured":"Gong, M., Li, G.: An efficient shortest path approach for social networks based on community structure. CAAI 1(1), 114\u2013123 (2016)","journal-title":"CAAI"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"19_CR4","first-page":"127","volume":"6","author":"IS Pohl","year":"1971","unstructured":"Pohl, I.S.: Bi-directional search. Mach. Intell. 6, 127\u2013140 (1971)","journal-title":"Mach. Intell."},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. 46(4), 1\u201331 (2014)","journal-title":"ACM Comput. Surv."},{"key":"19_CR6","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: 16th SODA, pp. 156\u2013165 (2005)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sommer, C.: Shortest-path queries for complex networks: exploiting low tree-width outside the core. In: EDBT, pp. 144\u2013155 (2012)","DOI":"10.1145\/2247596.2247614"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Qiao, M., Cheng, H.: Approximate shortest distance computing: a query-dependent local landmark scheme. In: 28th ICDE, pp. 462\u2013473 (2012)","DOI":"10.1109\/ICDE.2012.53"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Tretyakov, K.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: 20th CIKM, pp. 1785\u20131794 (2012)","DOI":"10.1145\/2063576.2063834"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"22","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 22, 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"19_CR11","first-page":"1203","volume":"7","author":"M Jiang","year":"2014","unstructured":"Jiang, M.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. PVLDB 7, 1203\u20131214 (2014)","journal-title":"PVLDB"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H.: Reach for A* shortest path algorithms with preprocessing. In: 9th DIMACS Implementation Challenge, vol. 74, pp. 93\u2013139 (2009)","DOI":"10.1090\/dimacs\/074\/05"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-38527-8_4","volume-title":"Experimental Algorithms","author":"D Delling","year":"2013","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Hub label compression. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 18\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_4"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Chechik, S.: Approximate distance oracle with constant query time. arXiv abs\/1305.3314 (2013)","DOI":"10.1145\/2591796.2591801"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/2390176.2390180","volume":"9","author":"W Chen","year":"2012","unstructured":"Chen, W.: A compact routing scheme and approximate distance oracle for power-law graphs. ACM Trans. Algorithms 9, 349\u2013360 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Andrea Lancichinetti","year":"2009","unstructured":"Andrea Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80, 016118 (2009)","journal-title":"Phys. Rev. E"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Xie, J.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: ICDMW, pp. 344\u2013349 (2012)","DOI":"10.1109\/ICDMW.2011.154"},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"19_CR21","first-page":"457","volume":"6","author":"AWC Fu","year":"2013","unstructured":"Fu, A.W.C., Wu, H.: IS-LABEL: an independent-set based labeling scheme for point-to-point distance querying on large graphs. VLDB 6(6), 457\u2013468 (2013)","journal-title":"VLDB"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Hayashi, T., Akiba, T., Kawarabayashi, K.I.: Fully dynamic shortest-path distance query acceleration on massive networks. In: CIKM, pp. 1533\u20131542 (2016)","DOI":"10.1145\/2983323.2983731"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98809-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:33:24Z","timestamp":1710232404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98809-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319988085","9783319988092"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98809-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Regensburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}