{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:40:03Z","timestamp":1749649203384,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319471204"},{"type":"electronic","value":"9783319471211"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47121-1_20","type":"book-chapter","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T14:22:58Z","timestamp":1476454978000},"page":"239-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Shortest Path Query Method Based on Tree Decomposition and Label Coverage"],"prefix":"10.1007","author":[{"given":"Xiaohuan","family":"Shan","sequence":"first","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Liyan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Baoyan","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,15]]},"reference":[{"key":"20_CR1","first-page":"1","volume":"19","author":"YX Tong","year":"2015","unstructured":"Tong, Y.X., She, J.Y., Meng, R.: Bottleneck-aware arrangement over event-based social networks: the max-min approach. World Wide Web-internet Web Inf. Syst. 19, 1\u201327 (2015)","journal-title":"World Wide Web-internet Web Inf. Syst."},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1007\/s11390-015-1588-0","volume":"30","author":"YX Tong","year":"2015","unstructured":"Tong, Y.X., She, J.Y., Chen, L.: Towards better understanding of app functions. J. Comput. Sci. Technol. 30(5), 1130\u20131140 (2015)","journal-title":"J. Comput. Sci. Technol."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"She, J.Y, Tong, Y.X., Chen, L.: Utility-aware event-participant planning. In: Proceedings of the 34th ACM SIGMOD International Conference on Management of Data (SIGMOD 2015), Melbourne, Victoria, Australia, pp. 1629\u20131643 (2015)","DOI":"10.1145\/2723372.2749446"},{"issue":"1","key":"20_CR4","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. J. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"J. Numer. Math."},{"issue":"6","key":"20_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345\u2013348 (1962)","journal-title":"Commun. ACM"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Xiao, Y.H., Wu, W.T., Pei, J., et al.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proceedings of the 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, pp. 493\u2013504 (2009)","DOI":"10.1145\/1516360.1516418"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Takuya, A., Christian, S., et al.: Shortest-path queries for complex networks: exploiting low tree-width outside the core. In: Proceedings of the 15th International Conference on Extending Database Technology, New York, USA, pp. 144\u2013155 (2012)","DOI":"10.1145\/2247596.2247614"},{"key":"20_CR8","unstructured":"Goldberg, A.V., Werneck, R.: Computing point-to-point shortest paths from external memory. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, London, pp. 26\u201340 (2005)"},{"key":"20_CR9","unstructured":"Schultes, D.: Route planning in road networks, Ph.D. thesis, Universitat Karlsruhe (2008)"},{"issue":"32","key":"20_CR10","first-page":"1","volume":"14","author":"J Maue","year":"2009","unstructured":"Maue, J., Sanders, P., et al.: Goal directed shortest path queries using precomputed cluster distances. J. Exp. Algorithms 14(32), 1\u201327 (2009). ACM","journal-title":"J. Exp. Algorithms"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Fang, W.: TEDI: efficient shortest path query answering on graphs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 99\u2013110 (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Konstantin, T., Abel, A.-C., et al.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, vol. 278(13), pp. 1785\u20131794 (2011)","DOI":"10.1145\/2063576.2063834"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47121-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T12:58:36Z","timestamp":1749646716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-47121-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319471204","9783319471211"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47121-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"15 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web-Age Information Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanchang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waim2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}