{"id":"https://openalex.org/W2107335359","doi":"https://doi.org/10.1002/net.20077","title":"Near-shortest and K-shortest simple paths","display_name":"Near-shortest and K-shortest simple paths","alternate_titles":[],"publication_year":2005,"publication_date":"2005-07-11","ids":{"openalex":"https://openalex.org/W2107335359","doi":"https://doi.org/10.1002/net.20077","mag":"2107335359"},"language":"en","primary_location":{"id":"doi:10.1002/net.20077","doi":"https://doi.org/10.1002/net.20077","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.20077","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,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"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"},"parent_works":[],"lineage":["https://openalex.org/W2107335359"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5028581734","display_name":"W. Matthew Carlyle","orcid":"https://orcid.org/0000-0003-4806-6634","observed_orcids":["https://orcid.org/0000-0003-4806-6634"]},"institutions":[{"id":"https://openalex.org/I35364215","display_name":"Naval Postgraduate School","ror":"https://ror.org/033yfkj90","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I3130687028","https://openalex.org/I35364215"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"W. Matthew Carlyle","raw_affiliation_strings":["Department of Operations Research, Naval Postgraduate School, Monterey, California 93943"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Naval Postgraduate School, Monterey, California 93943","institution_ids":["https://openalex.org/I35364215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017144766","display_name":"R. Kevin Wood","orcid":"https://orcid.org/0000-0002-0311-8712","observed_orcids":["https://orcid.org/0000-0002-0311-8712"]},"institutions":[{"id":"https://openalex.org/I35364215","display_name":"Naval Postgraduate School","ror":"https://ror.org/033yfkj90","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I3130687028","https://openalex.org/I35364215"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Kevin Wood","raw_affiliation_strings":["Department of Operations Research, Naval Postgraduate School, Monterey, California 93943"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Naval Postgraduate School, Monterey, California 93943","institution_ids":["https://openalex.org/I35364215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028581734"],"corresponding_institution_ids":["https://openalex.org/I35364215"],"apc_list":{"value":3750,"currency":"USD","value_usd":3750},"apc_paid":null,"fwci":1.8955,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.85043187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":"46","issue":"2","first_page":"98","last_page":"109"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T12292","display_name":"Graph Theory and Algorithms","score":0.00039999998989515007,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-shortest-paths","display_name":"k-shortest paths","score":0.8029999732971191},{"id":"https://openalex.org/keywords/simple-paths","display_name":"simple paths","score":0.953000009059906},{"id":"https://openalex.org/keywords/path-enumeration","display_name":"path enumeration","score":0.6740000247955322},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7279999852180481},{"id":"https://openalex.org/keywords/binary-search","display_name":"binary search","score":0.6110000014305115},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.5460000038146973},{"id":"https://openalex.org/keywords/grid-networks","display_name":"grid networks","score":0.6909999847412109},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.8889999985694885},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5550000071525574}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6991591453552246},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6202741861343384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5987775921821594},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5764790773391724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5463958978652954},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5433663725852966},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5214347243309021},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.519008994102478},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.48580145835876465},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4854200780391693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47076916694641113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46591830253601074},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44280168414115906},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4155704081058502},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3808633089065552},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29126977920532227},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.13324803113937378},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/net.20077","doi":"https://doi.org/10.1002/net.20077","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.20077","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,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"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"},{"id":"pmh:oai:calhoun.nps.edu:10945/38184","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10945/38184","pdf_url":null,"source":{"id":"https://openalex.org/S4306400952","display_name":"Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I35364215","host_organization_name":"Naval Postgraduate School","host_organization_lineage":["https://openalex.org/I35364215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.103.9390","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.9390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nps.navy.mil/orfacpag/resumePages/papers/Carlylepa/CarlyleWoodNSP05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.4184","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.4184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nps.navy.mil/orfacpag/resumePages/Wood-pubs/CarlyleWoodPaths.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1964416868","https://openalex.org/W1969097955","https://openalex.org/W1976969221","https://openalex.org/W1996805805","https://openalex.org/W2000071945","https://openalex.org/W2008620264","https://openalex.org/W2015035116","https://openalex.org/W2022980325","https://openalex.org/W2084224084","https://openalex.org/W2087684629","https://openalex.org/W2093517413","https://openalex.org/W2107993070","https://openalex.org/W2131058166","https://openalex.org/W2131856621","https://openalex.org/W2134986604","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2338905098","https://openalex.org/W2997134027","https://openalex.org/W3137299218"],"related_works":["https://openalex.org/W796163220","https://openalex.org/W2078948975","https://openalex.org/W4287245127","https://openalex.org/W1969097955","https://openalex.org/W2962770773","https://openalex.org/W2073296515","https://openalex.org/W3004523396","https://openalex.org/W6943961734","https://openalex.org/W4407556448"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,14,41,147],"new":[3],"algorithm":[4,55,124,140,171],"for":[5,125],"enumerating":[6],"all":[7],"near-shortest":[8],"simple":[9],"(loopless)":[10],"s-t":[11],"paths":[12,60],"in":[13,63],"graph":[15],"G":[16],"=":[17,26,30],"(V,":[18],"E)":[19],"with":[20,45,51,150,181],"nonnegative":[21],"edge":[22,75],"lengths.":[23],"Letting":[24],"n":[25],"|V|":[27],"and":[28,104,118],"m":[29],"|E|,":[31],"the":[32,57,73,87,91,138,142],"time":[33,78],"per":[34],"path":[35],"enumerated":[36],"is":[37,72,80,90,155,176],"O(nS(n,":[38],"m))":[39],"given":[40],"user-selected":[42],"shortest-path":[43],"subroutine":[44],"complexity":[46,79,89],"O(S(n,":[47],"m)).":[48],"When":[49],"coupled":[50],"binary":[52],"search,":[53],"this":[54,170],"solves":[56,173],"corresponding":[58],"K-shortest":[59],"problem":[61],"(KSPR)":[62],"O(KnS(n,":[64],"m)(log":[65],"n+":[66],"log":[67],"cmax))":[68],"time,":[69],"where":[70],"cmax":[71],"largest":[74],"length.":[76],"This":[77],"inferior":[81],"to":[82,100,102,105,107,128,178],"some":[83],"other":[84],"algorithms,":[85],"but":[86,180],"space":[88],"best":[92,122,139],"available":[93],"at":[94,130],"O(m).":[95],"Both":[96],"algorithms":[97],"are":[98],"easy":[99],"describe,":[101],"implement":[103],"extend":[106],"more":[108],"general":[109],"classes":[110],"of":[111,134,158],"graphs.":[112],"In":[113],"computational":[114],"tests":[115],"on":[116,162,169],"grid":[117],"road":[119],"networks,":[120],"our":[121],"polynomial-time":[123],"KSPR":[126,179],"appears":[127],"be":[129],"least":[131],"an":[132],"order":[133],"magnitude":[135,159],"faster":[136,160],"than":[137],"from":[141],"literature.":[143],"However,":[144],"we":[145],"devise":[146],"simpler":[148],"algorithm,":[149],"exponential":[151],"worst-case":[152],"complexity,":[153],"that":[154],"several":[156],"orders":[157],"yet":[161],"those":[163],"test":[164],"problems.":[165],"A":[166],"minor":[167],"variant":[168],"also":[172],"\u201cKSPU,\u201d":[174],"which":[175],"analogous":[177],"loops":[182],"allowed.":[183],"\u00a9":[184],"2005":[185,193],"Wiley":[186],"Periodicals,":[187],"Inc.":[188],"NETWORKS,":[189],"Vol.":[190],"46(2),":[191],"98\u2013109":[192]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2107335359","counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":9}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
