{"id":"https://openalex.org/W2082795813","doi":"https://doi.org/10.1002/net.3230220103","title":"An optimal algorithm to solve the all\u2010pair shortest path problem on interval graphs","display_name":"An optimal algorithm to solve the all\u2010pair shortest path problem on interval graphs","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2082795813","doi":"https://doi.org/10.1002/net.3230220103","mag":"2082795813"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]},{"id":"https://openalex.org/I215927","display_name":"University of Madras","ror":"https://ror.org/04jmt9361","country_code":"IN","type":"education","lineage":["https://openalex.org/I215927"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Department of Computer Science, I.I.T. Madras 600036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, I.I.T. Madras 600036, India","institution_ids":["https://openalex.org/I215927","https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I215927","display_name":"University of Madras","ror":"https://ror.org/04jmt9361","country_code":"IN","type":"education","lineage":["https://openalex.org/I215927"]},{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Madhav V. Marathe","raw_affiliation_strings":["Department of Computer Science, I.I.T. Madras 600036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, I.I.T. Madras 600036, India","institution_ids":["https://openalex.org/I215927","https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103487617","display_name":"C. Pandu Rangan","orcid":null},"institutions":[{"id":"https://openalex.org/I215927","display_name":"University of Madras","ror":"https://ror.org/04jmt9361","country_code":"IN","type":"education","lineage":["https://openalex.org/I215927"]},{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Pandu Rangan","raw_affiliation_strings":["Department of Computer Science, I.I.T. Madras 600036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, I.I.T. Madras 600036, India","institution_ids":["https://openalex.org/I215927","https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087844619"],"corresponding_institution_ids":["https://openalex.org/I215927","https://openalex.org/I24676775"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.8577,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.85991487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"1","first_page":"21","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6825125217437744},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6696811318397522},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6093157529830933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6071910858154297},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4957340657711029},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.49339762330055237},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.46393969655036926},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4330725073814392},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.43300437927246094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42667150497436523},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3749122619628906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3640199303627014},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14524859189987183}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6825125217437744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6696811318397522},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6093157529830933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6071910858154297},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4957340657711029},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.49339762330055237},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.46393969655036926},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4330725073814392},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.43300437927246094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42667150497436523},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3749122619628906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3640199303627014},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14524859189987183}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W9957747","https://openalex.org/W1655990431","https://openalex.org/W2004635739","https://openalex.org/W2006147407","https://openalex.org/W2021568739","https://openalex.org/W2053623386","https://openalex.org/W2055217195","https://openalex.org/W2143474538","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W110470963","https://openalex.org/W2031276298","https://openalex.org/W2028363955","https://openalex.org/W2016277208","https://openalex.org/W4283803822","https://openalex.org/W1970625924","https://openalex.org/W2407258439"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"an":[3,22],"O":[4],"(":[5],"n":[6],"2":[7],")":[8],"time\u2010optimal":[9],"algorithm":[10],"for":[11],"solving":[12],"the":[13,32,40,48,52,57,61],"unweighted":[14],"all\u2010pair":[15],"shortest":[16],"path":[17],"problem":[18],"on":[19],"interval":[20],"graphs,":[21],"important":[23],"subclass":[24],"of":[25,51],"perfect":[26],"graphs.":[27],"An":[28],"interesting":[29],"structure":[30],"called":[31],"neighborhood":[33],"tree":[34,43],"is":[35,44],"studied":[36],"and":[37],"used":[38],"in":[39,56],"algorithm.":[41],"This":[42],"formed":[45],"by":[46],"identifying":[47],"successive":[49],"neighborhoods":[50],"vertex":[53],"labeled":[54],"last":[55],"graph":[58],"according":[59],"to":[60],"IG\u2010ordering.":[62]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}