{"id":"https://openalex.org/W1969097955","doi":"https://doi.org/10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","title":"An efficient implementation of an algorithm for findingK shortest simple paths","display_name":"An efficient implementation of an algorithm for findingK shortest simple paths","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W1969097955","doi":"https://doi.org/10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","mag":"1969097955"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","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/A5004645507","display_name":"E. Hadjiconstantinou","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"E. Hadjiconstantinou","raw_affiliation_strings":["Centre for Quantitative Finance, Imperial College Management School, Exhibition Rd, London SW7 2PG, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Quantitative Finance, Imperial College Management School, Exhibition Rd, London SW7 2PG, England","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034735337","display_name":"N. Christofides","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"N. Christofides","raw_affiliation_strings":["Centre for Quantitative Finance, Imperial College Management School, Exhibition Rd, London SW7 2PG, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Quantitative Finance, Imperial College Management School, Exhibition Rd, London SW7 2PG, England","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004645507"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.9088,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.89893343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"34","issue":"2","first_page":"88","last_page":"101"},"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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/simple","display_name":"Simple (philosophy)","score":0.6435225009918213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5858684182167053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5333063006401062},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.502999484539032},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5016186237335205},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4842338562011719},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46870559453964233},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.458880752325058},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.455858051776886},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.42889949679374695},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.397892028093338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3692973256111145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3200913369655609}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6435225009918213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5858684182167053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5333063006401062},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.502999484539032},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5016186237335205},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4842338562011719},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46870559453964233},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.458880752325058},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.455858051776886},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.42889949679374695},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.397892028093338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3692973256111145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3200913369655609},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","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":48,"referenced_works":["https://openalex.org/W376922811","https://openalex.org/W1550531993","https://openalex.org/W1931114878","https://openalex.org/W1966557890","https://openalex.org/W1968198624","https://openalex.org/W1973804680","https://openalex.org/W1984407615","https://openalex.org/W1997102717","https://openalex.org/W2011282943","https://openalex.org/W2013627567","https://openalex.org/W2014156227","https://openalex.org/W2022980325","https://openalex.org/W2027442194","https://openalex.org/W2030169809","https://openalex.org/W2034710274","https://openalex.org/W2038902712","https://openalex.org/W2052497422","https://openalex.org/W2053723217","https://openalex.org/W2057455980","https://openalex.org/W2058489727","https://openalex.org/W2061632451","https://openalex.org/W2063317962","https://openalex.org/W2065474496","https://openalex.org/W2069295656","https://openalex.org/W2076862344","https://openalex.org/W2078948975","https://openalex.org/W2081255840","https://openalex.org/W2084224084","https://openalex.org/W2089845007","https://openalex.org/W2089957823","https://openalex.org/W2091243858","https://openalex.org/W2096594665","https://openalex.org/W2102755248","https://openalex.org/W2105100091","https://openalex.org/W2121913917","https://openalex.org/W2131058166","https://openalex.org/W2135819212","https://openalex.org/W2144050074","https://openalex.org/W2154434560","https://openalex.org/W2160365857","https://openalex.org/W2163526781","https://openalex.org/W2164485560","https://openalex.org/W2166739719","https://openalex.org/W2168949701","https://openalex.org/W2169528473","https://openalex.org/W2753176400","https://openalex.org/W4249958171","https://openalex.org/W6677555952"],"related_works":["https://openalex.org/W2327631927","https://openalex.org/W2093568763","https://openalex.org/W69297589","https://openalex.org/W1985166372","https://openalex.org/W2003096546","https://openalex.org/W4289354592","https://openalex.org/W2430210575","https://openalex.org/W2165069859","https://openalex.org/W2099112646","https://openalex.org/W2112258778"],"abstract_inverted_index":{"In":[0],"this":[1,72],"article,":[2],"we":[3],"present":[4],"an":[5,10,25],"efficient":[6],"computational":[7,155],"implementation":[8],"of":[9,22,40,49,64,77,88,103,109,116,120,129,144],"algorithm":[11,79],"for":[12,71,96],"finding":[13],"the":[14,47,60,78,89,126,141,153],"K":[15],"shortest":[16],"simple":[17],"paths":[18,42,104],"connecting":[19],"a":[20,100,113],"pair":[21],"vertices":[23],"in":[24,136],"undirected":[26],"graph":[27,148],"with":[28,82,112],"n":[29],"vertices,":[30],"m":[31],"arcs,":[32],"and":[33,52,85,98,123,140],"nonnegative":[34],"arc":[35],"lengths.":[36],"A":[37,74],"minimal":[38],"number":[39,102,115],"intermediate":[41],"is":[43,80],"formed":[44],"based":[45],"on":[46,132,147],"method":[48],"Katoh,":[50],"Ibaraki":[51],"Mine":[53],"[Networks":[54],"12":[55],"(1982),":[56],"411\u2013427],":[57],"which":[58],"has":[59],"lowest":[61],"worst-case":[62,154],"complexity":[63],"O(n2)":[65],"among":[66],"all":[67],"other":[68],"existing":[69],"algorithms":[70],"problem.":[73],"theoretical":[75],"description":[76],"presented":[81],"detailed":[83],"explanations":[84],"some":[86],"examples":[87],"more":[90],"complicated":[91],"steps.":[92],"Efficient":[93],"data":[94],"structures":[95],"storing":[97],"retrieving":[99],"large":[101,114],"are":[105],"given.":[106],"The":[107],"results":[108],"wide-ranging":[110],"experimentation":[111],"randomly":[117],"generated":[118],"graphs":[119],"varying":[121],"size":[122,149],"density":[124],"confirm":[125],"linear":[127],"dependency":[128,143],"computing":[130,145],"time":[131,146],"K,":[133],"as":[134,150],"proven":[135],"Katoh":[137],"et":[138],"al.,":[139],"quadratic":[142],"suggested":[151],"by":[152],"complexity.":[156],"\u00a9":[157],"1999":[158,167],"John":[159],"Wiley":[160],"&":[161],"Sons,":[162],"Inc.":[163],"Networks":[164],"34:":[165],"88\u2013101,":[166]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}