{"id":"https://openalex.org/W1970098991","doi":"https://doi.org/10.1002/net.3230040404","title":"Shortest alternating path algorithms","display_name":"Shortest alternating path algorithms","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W1970098991","doi":"https://doi.org/10.1002/net.3230040404","mag":"1970098991"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230040404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040404","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/A5072420857","display_name":"James R. Brown","orcid":"https://orcid.org/0000-0003-2800-1964"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. R. Brown","raw_affiliation_strings":["Kent State University, Kent, Ohio","Kent State University, Kent, Ohio.#TAB#"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, Ohio","institution_ids":["https://openalex.org/I149910238"]},{"raw_affiliation_string":"Kent State University, Kent, Ohio.#TAB#","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072420857"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.11932773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"4","first_page":"311","last_page":"334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.98580002784729,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9742000102996826,"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.8269146680831909},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6003286242485046},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5918296575546265},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5797361731529236},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5440695285797119},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5321739315986633},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5129408240318298},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5083057284355164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49723556637763977},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.49321645498275757},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4842824339866638},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45802271366119385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4564738869667053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4482010304927826},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39241892099380493},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35692787170410156},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2251269817352295}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8269146680831909},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6003286242485046},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5918296575546265},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5797361731529236},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5440695285797119},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5321739315986633},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5129408240318298},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5083057284355164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49723556637763977},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.49321645498275757},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4842824339866638},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45802271366119385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4564738869667053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4482010304927826},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39241892099380493},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35692787170410156},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2251269817352295},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":1,"locations":[{"id":"doi:10.1002/net.3230040404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040404","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":14,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W1999667176","https://openalex.org/W2007572995","https://openalex.org/W2027421115","https://openalex.org/W2048652909","https://openalex.org/W2144050074","https://openalex.org/W2166703666","https://openalex.org/W2327315803","https://openalex.org/W2335389215","https://openalex.org/W3163104596","https://openalex.org/W4231139853","https://openalex.org/W4233756358","https://openalex.org/W4244424643","https://openalex.org/W4247549312"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W4200172719","https://openalex.org/W2776102956","https://openalex.org/W4293054712","https://openalex.org/W2353519994"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"concept":[2],"of":[3,23,47,58,71,100,109],"an":[4,83],"alternating":[5,36,51,63,93,110],"path":[6,37,64,75],"has":[7,16],"been":[8,30],"very":[9],"useful":[10],"in":[11,38,76,103],"analyzing":[12],"matching":[13,24],"problems":[14],"and":[15,49,53],"formed":[17],"the":[18,34,56,60,73,90,101],"basis":[19],"for":[20,88],"a":[21,39,69,77],"number":[22],"algorithms.":[25],"However,":[26],"no":[27],"techniques":[28,102],"have":[29],"devised":[31],"to":[32,106],"find":[33],"shortest":[35,61,74,91],"weighted":[40],"graph.":[41,79],"This":[42],"paper":[43,105],"defines":[44],"different":[45],"types":[46,108],"directed":[48,62,78],"undirected":[50,92],"paths,":[52],"shows":[54],"how":[55],"problem":[57,70],"finding":[59,72,89],"can":[65],"be":[66],"transformed":[67],"into":[68],"Utilizing":[80],"this":[81,104],"transformation,":[82],"efficient":[84],"algorithm":[85],"is":[86,97],"developed":[87],"path.":[94],"Computational":[95],"experience":[96],"given.":[98],"Extensions":[99],"other":[107],"paths":[111],"are":[112],"discussed.":[113]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}