{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:48:20Z","timestamp":1763466500930},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319265193"},{"type":"electronic","value":"9783319265209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26520-9_5","type":"book-chapter","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T15:13:03Z","timestamp":1448723583000},"page":"53-60","source":"Crossref","is-referenced-by-count":2,"title":["Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Chapuis","sequence":"first","affiliation":[]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Xu, J.: Shortest path queries in planar graphs. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 469\u2013478. ACM, New York (2000)","DOI":"10.1145\/335305.335359"},{"issue":"1","key":"5_CR2","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(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-62559-3_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H Djidjev","year":"1997","unstructured":"Djidjev, H.: Efficient algorithms for shortest path queries in planar digraphs. In: d\u2019Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 1197, pp. 151\u2013165. Springer, Heidelberg (1997)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Djidjev, H., Chapuis, G.: Shortest-path queries in planar graphs on GPU-accelerated architectures (arXiv). CoRR (2015). \n                      http:\/\/arxiv.org","DOI":"10.1007\/978-3-319-26520-9_5"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Djidjev, H., Thulasidasan, S., Chapuis, G., Andonov, R., Lavenier, D.: Efficient multi-GPU computation of all-pairs shortest paths. In: IPDPS, pp. 360\u2013369 (2014)","DOI":"10.1109\/IPDPS.2014.46"},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"GN Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Planar graph decomposition and all pairs shortest paths. J. ACM 38(1), 162\u2013204 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Mozes, S., Sommer, C.: Exact distance oracles for planar graphs. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 209\u2013222 (2012)","DOI":"10.1137\/1.9781611973099.19"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26520-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T18:36:04Z","timestamp":1559327764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26520-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319265193","9783319265209"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26520-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}