{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T17:41:18Z","timestamp":1684863678491},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0020-0190(91)90200-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"317-322","source":"Crossref","is-referenced-by-count":5,"title":["Shortest path and closure algorithms for banded matrices"],"prefix":"10.1016","volume":"40","author":[{"given":"L.","family":"Allison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.I.","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.N.","family":"Yee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90200-2_BIB1","series-title":"Shortest path and closure algorithms for banded matrices","author":"Allison","year":"1989"},{"issue":"1","key":"10.1016\/0020-0190(91)90200-2_BIB2","first-page":"97","article-title":"Restriction site mapping is in separation theory","volume":"4","author":"Allison","year":"1989","journal-title":"Comp. Appl. BioSciences"},{"key":"10.1016\/0020-0190(91)90200-2_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"issue":"1","key":"10.1016\/0020-0190(91)90200-2_BIB4","first-page":"117","article-title":"Errors between sites in restriction site mapping","volume":"4","author":"Dix","year":"1988","journal-title":"Comput. Appl. BioSciences"},{"key":"10.1016\/0020-0190(91)90200-2_BIB5","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/PROC.1977.10514","article-title":"Survey of sparse matrix research","volume":"65","author":"Duff","year":"1977","journal-title":"Proc. IEEE"},{"key":"10.1016\/0020-0190(91)90200-2_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest Path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(91)90200-2_BIB7","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1109\/HICSS.1991.183933","article-title":"Constraint checking for restriction site mapping","volume":"1","author":"Ho","year":"1991","journal-title":"Proc. Twenty-Fourth Ann. Hawaii Internat. Conf. on System Sciences"},{"issue":"4","key":"10.1016\/0020-0190(91)90200-2_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1147\/rd.134.0387","article-title":"Shortcut in the decomposition algorithm for shortest paths in a network","volume":"13","author":"Hu","year":"1969","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0020-0190(91)90200-2_BIB9","series-title":"Tech. Rept.","article-title":"On the shortest path algorithms for sparse graphs","author":"Srinivasan","year":"1982"},{"issue":"1","key":"10.1016\/0020-0190(91)90200-2_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on boolean matrices","volume":"9","author":"Warshall","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90200-2_BIB11","doi-asserted-by":"crossref","unstructured":"J.Y. Yen, On Hu's decomposition algorithm for shortest paths in a network, Oper. Res. 19 (4) 983\u2013985.","DOI":"10.1287\/opre.19.4.983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902002?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902002?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:06Z","timestamp":1555132866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091902002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0020019091902002"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90200-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}