{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:23:13Z","timestamp":1648891393484},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0166-218x(95)00088-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"169-182","source":"Crossref","is-referenced-by-count":5,"title":["All-pairs-shortest-length on strongly chordal graphs"],"prefix":"10.1016","volume":"69","author":[{"given":"V.","family":"Balachandhran","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00088-9_BIB1","series-title":"Proceedings 1st Annual European Symposium on Algorithms","first-page":"429","article-title":"An optimal algorithm for shortest paths on weighted interval and circular-arc graphs with applications","volume":"14","author":"Atallah","year":"1995"},{"key":"10.1016\/0166-218X(95)00088-9_BIB2","article-title":"An approximate algorithm for shortest-length queries on trapezoidal graphs","author":"Balachandran","year":"1994"},{"key":"10.1016\/0166-218X(95)00088-9_BIB3","article-title":"Shortest-length queries on interval and circular-arc graphs","author":"Balachandran","year":"1994"},{"key":"10.1016\/0166-218X(95)00088-9_BIB4","article-title":"Shortest-length queries on permutation graphs","author":"Balachandran","year":"1994"},{"key":"10.1016\/0166-218X(95)00088-9_BIB5","series-title":"Intoduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0166-218X(95)00088-9_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterization of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00088-9_BIB7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(95)00088-9_BIB8","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","article-title":"Fast algorithms for shortest paths in planar graphs, with applications","volume":"16","author":"Frederickson","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00088-9_BIB9","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonocci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)00088-9_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(82)90031-2","article-title":"A new algorithm to find the shortest paths between all pairs of nodes","volume":"4","author":"Gallo","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00088-9_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","article-title":"Efficient algorithms for shortest paths in sparse networks","volume":"24","author":"Johnson","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)00088-9_BIB12","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(95)00088-9_BIB13","article-title":"Domination and path problems in permutation graphs","author":"Mahesh","year":"1989","journal-title":"Thesis Report"},{"key":"10.1016\/0166-218X(95)00088-9_BIB14","series-title":"Introduction to Algorithms \u2014 A Creative Approach","author":"Manber","year":"1989"},{"key":"10.1016\/0166-218X(95)00088-9_BIB15","series-title":"Proceedings FCT 83","first-page":"302","article-title":"A single source shortest path algorithm for graphs with separators","volume":"Vol. 158","author":"Mehlhorn","year":"1983"},{"key":"10.1016\/0166-218X(95)00088-9_BIB16","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00088-9_BIB17","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal."},{"key":"10.1016\/0166-218X(95)00088-9_BIB18","series-title":"Proceedings of the 25th Annual ACM Symposium on the Theory of Computing","first-page":"745","article-title":"On all-pairs-shortest-path problem","author":"Seidel","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95000889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95000889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:23:14Z","timestamp":1556277794000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X95000889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0166218X95000889"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00088-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}