{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:45:38Z","timestamp":1740102338227,"version":"3.37.3"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:00:00Z","timestamp":1688342400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:00:00Z","timestamp":1688342400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,3]]},"DOI":"10.1109\/codit58514.2023.10284353","type":"proceedings-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T17:46:12Z","timestamp":1698169572000},"page":"956-961","source":"Crossref","is-referenced-by-count":0,"title":["The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7093-2175","authenticated-orcid":false,"given":"Roland","family":"Grappe","sequence":"first","affiliation":[{"name":"Université Sorbonne Paris Nord,LIPN,Paris,France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8385-3890","authenticated-orcid":false,"given":"Mathieu","family":"Lacroix","sequence":"additional","affiliation":[{"name":"Université Sorbonne Paris Nord,LIPN,Paris,France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-6698","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Martin","sequence":"additional","affiliation":[{"name":"Huaweï Technologies & Co,Boulogne-Billancourt,France"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0124"},{"key":"ref14","first-page":"925","volume":"3","author":"wollman","year":"1995","journal-title":"Overview of open shortest path first version 2 (ospf v2) routing in the tactical environment"},{"key":"ref11","first-page":"561","article-title":"An algebraic decomposed algorithm for all pairs shortest paths","volume":"10","author":"wang","year":"2014","journal-title":"Pacific Journal of Optimization"},{"key":"ref10","first-page":"216","article-title":"Transitivité et connexité","volume":"249","author":"roy","year":"1959","journal-title":"C R Acad Sci Paris"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref8","first-page":"116","article-title":"Graphs and matrices (in hungarian)","volume":"38","author":"k\u00f6ning","year":"1931","journal-title":"Mat Fiz Lapok"},{"key":"ref7","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553908"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2023.01.008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"}],"event":{"name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2023,7,3]]},"location":"Rome, Italy","end":{"date-parts":[[2023,7,6]]}},"container-title":["2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10284032\/10284045\/10284353.pdf?arnumber=10284353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:03:03Z","timestamp":1699902183000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10284353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,3]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/codit58514.2023.10284353","relation":{},"subject":[],"published":{"date-parts":[[2023,7,3]]}}}