{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:59:53Z","timestamp":1743134393733,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031534676"},{"type":"electronic","value":"9783031534683"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53468-3_29","type":"book-chapter","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T13:03:57Z","timestamp":1708347837000},"page":"339-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learned Approximate Distance Labels for\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Ikeoluwa","family":"Abioye","sequence":"first","affiliation":[]},{"given":"Allison","family":"Gunby-Mann","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Sarel","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Chin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/S0895480103433409","volume":"19","author":"S Alstrup","year":"2005","unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. Disc. Math. 19(2), 448\u2013462 (2005)","journal-title":"SIAM J. Disc. Math."},{"key":"29_CR3","unstructured":"Alstrup, S., Dahlgaard, S., Knudsen, M.B.T., Porat, E.: Sublinear distance labeling. In: 24th Annual European Symposium on Algorithms (ESA 2016), vol. 57, pp. 5:1\u20135:15 (2016)"},{"key":"29_CR4","unstructured":"Alstrup, S., G\u00f8rtz, I.L., Halvorsen, E.B., Porat, E.: Distance labeling schemes for trees. CoRR arxiv:1507.04046 (2015)"},{"key":"29_CR5","unstructured":"Alstrup, S., G\u00f8rtz, I.L., Halvorsen, E.B., Porat, E.: Distance labeling schemes for trees. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, LIPIcs, vol. 55, pp. 132:1\u2013132:16 (2016)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Kaplan, H., Thorup, M., Zwick, U.: Adjacency labeling schemes and induced-universal graphs. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 625\u2013634 (2015)","DOI":"10.1145\/2746539.2746545"},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"Alstrup, S., LiG\u00f8rtz, I., Halvorsen, E.B., Porat, E.: Distance labeling schemes for trees. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, 11\u201315 July 2016, LIPIcs, vol. 55, pp. 132:1\u2013132:16 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.132","DOI":"10.4230\/LIPIcs.ICALP.2016.132"},{"key":"29_CR8","unstructured":"Brunner, D.: Distance preserving graph embedding (2021)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J., Qin, L., Cheng, H., Qiao, M.: The exact distance to destination in undirected world. VLDB J. 21 (2012)","DOI":"10.1007\/s00778-012-0274-x"},{"issue":"1","key":"29_CR10","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":"29_CR11","doi-asserted-by":"crossref","unstructured":"Freedman, O., Gawrychowski, P., Nicholson, P.K., Weimann, O.: Optimal distance labeling schemes for trees. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 185\u2013194 (2017)","DOI":"10.1145\/3087801.3087804"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Freedman, O., Gawrychowski, P., Nicholson, P.K., Weimann, O.: Optimal distance labeling schemes for trees. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, 25\u201327 July 2017, pp. 185\u2013194. ACM (2017)","DOI":"10.1145\/3087801.3087804"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algor. 53(1), 85\u2013112 (2004)","journal-title":"J. Algor."},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"29_CR15","unstructured":"Neff, J.: Neural distance oracle for road graphs (2021)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53468-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T13:12:09Z","timestamp":1718629929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53468-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534676","9783031534683"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53468-3_29","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Menton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}