{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:41Z","timestamp":1749725021231},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5397,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present an <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>) time\u2010optimal algorithm for solving the unweighted all\u2010pair shortest path problem on interval graphs, an important subclass of perfect graphs. An interesting structure called the <jats:italic>neighborhood tree<\/jats:italic> is studied and used in the algorithm. This tree is formed by identifying the successive neighborhoods of the vertex labeled last in the graph according to the IG\u2010ordering.<\/jats:p>","DOI":"10.1002\/net.3230220103","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T11:49:30Z","timestamp":1178970570000},"page":"21-35","source":"Crossref","is-referenced-by-count":23,"title":["An optimal algorithm to solve the all\u2010pair shortest path problem on interval graphs"],"prefix":"10.1002","volume":"22","author":[{"given":"R.","family":"Ravi","sequence":"first","affiliation":[]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A.","year":"1974"},{"key":"e_1_2_1_3_2","unstructured":"S.Aravind R.Mahesh andC.Pandu Rangan Bandwidth optimization for interval graphs revisited.Inform. and Computation in press."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90086-8"},{"key":"e_1_2_1_5_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90050-X"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"A.MoffatandT.Takoka An all\u2010pair shortest path algorithm with expected running timeO(n2logn).Proceedings of the IEEE Symposium on Foundations of Computer Science(1985)101\u2013105.","DOI":"10.1109\/SFCS.1985.6"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90091-9"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90184-1"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T13:42:38Z","timestamp":1698154958000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/net.3230220103"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220103","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}