{"id":"https://openalex.org/W2092243261","doi":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","title":"A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph","display_name":"A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W2092243261","doi":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","mag":"2092243261"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","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/A5084536803","display_name":"Prakash Mirchandani","orcid":"https://orcid.org/0000-0003-3436-9378"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Prakash Mirchandani","raw_affiliation_strings":["Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260"],"affiliations":[{"raw_affiliation_string":"Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084536803"],"corresponding_institution_ids":["https://openalex.org/I170201317"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0117,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77166999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"3","first_page":"215","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9958999752998352,"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.9958999752998352,"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.9948999881744385,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7301377058029175},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49654966592788696},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4820307493209839},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4683617353439331},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4646299481391907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.445600688457489},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.44154059886932373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44149404764175415},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.43899962306022644},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4389888346195221},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.435322642326355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4269101619720459},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41902539134025574},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4138035178184509},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.363888144493103},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22741910815238953},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1746966540813446}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7301377058029175},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49654966592788696},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4820307493209839},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4683617353439331},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4646299481391907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.445600688457489},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.44154059886932373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44149404764175415},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.43899962306022644},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4389888346195221},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.435322642326355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4269101619720459},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41902539134025574},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4138035178184509},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.363888144493103},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22741910815238953},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1746966540813446},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<215::aid-net6>3.0.co;2-l","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2352589493","https://openalex.org/W3183360588","https://openalex.org/W2100214387","https://openalex.org/W2198982833","https://openalex.org/W3029625820","https://openalex.org/W2163460271","https://openalex.org/W2388014219","https://openalex.org/W2183791707"],"abstract_inverted_index":{"Let":[0],"G":[1],"denote":[2],"an":[3],"interval":[4],"graph":[5,30],"with":[6],"n":[7],"vertices":[8],"and":[9,58],"unit":[10],"weight":[11],"edges.":[12],"In":[13],"this":[14,36],"paper,":[15],"we":[16],"present":[17],"a":[18],"simple":[19],"O(n2)":[20],"algorithm":[21,34,50],"for":[22,35],"solving":[23],"the":[24,39],"all-pairs":[25],"shortest":[26],"path":[27],"problem":[28,37],"on":[29],"G.":[31],"A":[32],"recent":[33],"has":[38],"same":[40],"time-complexity":[41],"but":[42],"is":[43,51],"fairly":[44],"complicated":[45],"to":[46,53,56,60],"describe.":[47],"However,":[48],"our":[49],"concise":[52],"state,":[54],"intuitive":[55],"understand,":[57],"easy":[59],"implement.":[61],"\u00a9":[62],"1996":[63],"John":[64],"Wiley":[65],"&":[66],"Sons,":[67],"Inc.":[68]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}