{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:38:47Z","timestamp":1725867527734},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319465647"},{"type":"electronic","value":"9783319465654"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46565-4_16","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T11:20:30Z","timestamp":1475925630000},"page":"200-212","source":"Crossref","is-referenced-by-count":3,"title":["Top-k Shortest Paths in Directed Labeled Multigraphs"],"prefix":"10.1007","author":[{"given":"Sven","family":"Hertling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Jilek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Dengel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"issue":"18","key":"16_CR1","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1016\/j.artint.2011.07.003","volume":"175","author":"H Aljazzar","year":"2011","unstructured":"Aljazzar, H., Leue, S.: K*: a heuristic search algorithm for finding the k shortest paths. Artif. Intell. 175(18), 2129\u20132154 (2011)","journal-title":"Artif. Intell."},{"issue":"2","key":"16_CR2","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"16_CR3","unstructured":"Gubichev, A., Neumann, T.: Path query processing on very large RDF graphs. In: WebDB. Citeseer (2011)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for owl knowledge base systems. Web Semant. Sci. Serv. Agents World Wide Web 3(2) (2005)","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-44867-5_14","volume-title":"Experimental and Efficient Algorithms","author":"VM Jim\u00e9nez","year":"2003","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: A lazy version of Eppstein\u2019s K shortest paths algorithm. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 179\u2013191. Springer, Heidelberg (2003)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-25007-6_1","volume-title":"The Semantic Web - ISWC 2015","author":"EV Kostylev","year":"2015","unstructured":"Kostylev, E.V., Reutter, J.L., Romero, M., Vrgo\u010d, D.: SPARQL with property paths. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 3\u201318. Springer International Publishing, Switzerland (2015)"},{"key":"16_CR7","unstructured":"Lehmann, J., Sch\u00fcppel, J., Auer, S.: Discovering unknown connections-the dbpedia relationship finder. In: CSSW, vol. 113, pp. 99\u2013110 (2007)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Losemann, K., Martens, W.: The complexity of evaluating path expressions in SPARQL. In: Proceedings of the 31st Symposium on Principles of Database Systems, pp. 101\u2013112. ACM (2012)","DOI":"10.1145\/2213556.2213573"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/978-3-642-25073-6_29","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"M Morsey","year":"2011","unstructured":"Morsey, M., Lehmann, J., Auer, S., Ngonga Ngomo, A.-C.: DBpedia SPARQL benchmark \u2013 performance assessment with real queries on real data. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol. 7031, pp. 454\u2013469. Springer, Heidelberg (2011)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Morsey, M., Lehmann, J., Auer, S., Ngonga Ngomo, A.-C.: Usage-centric benchmarking of RDF triple stores. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI 2012) (2012)","DOI":"10.1609\/aaai.v26i1.8448"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-642-25953-1_5","volume-title":"The Semantic Web: ESWC 2011 Workshops","author":"M Przyjaciel-Zablocki","year":"2012","unstructured":"Przyjaciel-Zablocki, M., Sch\u00e4tzle, A., Hornung, T., Lausen, G.: RDFPath: path query processing on large RDF graphs with MapReduce. In: Garc\u00eda-Castro, R., Fensel, D., Antoniou, G. (eds.) ESWC 2011. LNCS, vol. 7117, pp. 50\u201364. Springer, Heidelberg (2012)"},{"issue":"11","key":"16_CR12","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."}],"container-title":["Communications in Computer and Information Science","Semantic Web Challenges"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46565-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T23:46:42Z","timestamp":1657410402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46565-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319465647","9783319465654"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46565-4_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}