{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:29Z","timestamp":1749725009066},"reference-count":0,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":7062,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1002\/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T04:48:42Z","timestamp":1100234922000},"page":"215-217","source":"Crossref","is-referenced-by-count":9,"title":["A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph"],"prefix":"10.1002","volume":"27","author":[{"given":"Prakash","family":"Mirchandani","sequence":"first","affiliation":[]}],"member":"311","container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(199605)27:3%3C215::AID-NET6%3E3.0.CO;2-L","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(199605)27:3%3C215::AID-NET6%3E3.0.CO;2-L","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:28:23Z","timestamp":1625135303000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(199605)27:3<215::AID-NET6>3.0.CO;2-L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,5]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}