{"id":"https://openalex.org/W1931114878","doi":"https://doi.org/10.1002/net.3230160204","title":"Implementation of algorithms for K shortest loopless paths","display_name":"Implementation of algorithms for K shortest loopless paths","publication_year":1986,"publication_date":"1986-06-01","ids":{"openalex":"https://openalex.org/W1931114878","doi":"https://doi.org/10.1002/net.3230160204","mag":"1931114878"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230160204","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5111508513","display_name":"Aarni Perko","orcid":null},"institutions":[{"id":"https://openalex.org/I94722563","display_name":"University of Jyv\u00e4skyl\u00e4","ror":"https://ror.org/05n3dz165","country_code":"FI","type":"education","lineage":["https://openalex.org/I94722563"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Aarni Perko","raw_affiliation_strings":["Department of Mathematics, University of Jyv\u00e4skyl\u00e4, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Jyv\u00e4skyl\u00e4, Finland","institution_ids":["https://openalex.org/I94722563"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111508513"],"corresponding_institution_ids":["https://openalex.org/I94722563"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400,"provenance":"doaj"},"apc_paid":null,"fwci":0.451,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":53,"citation_normalized_percentile":{"value":0.974105,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":94},"biblio":{"volume":"16","issue":"2","first_page":"149","last_page":"160"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9926,"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/T11106","display_name":"Data Management and Algorithms","score":0.9883,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.46140733},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.41787988}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7001659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6730204},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5848048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.51795757},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5055249},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4715507},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.46140733},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.41787988},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.41604644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39837354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34600917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15737545},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230160204","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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W1973804680","https://openalex.org/W2010945917","https://openalex.org/W2011282943","https://openalex.org/W2026039762","https://openalex.org/W2036030013","https://openalex.org/W2048822735","https://openalex.org/W2053723217","https://openalex.org/W2073236228","https://openalex.org/W2078948975","https://openalex.org/W2089845007","https://openalex.org/W2125690626","https://openalex.org/W376922811","https://openalex.org/W75356743"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W4223969905","https://openalex.org/W2886722595","https://openalex.org/W2597144308","https://openalex.org/W2392078542","https://openalex.org/W2391130892","https://openalex.org/W2360981904","https://openalex.org/W2354846196","https://openalex.org/W2347245430","https://openalex.org/W2170980056"],"abstract_inverted_index":{"Abstract":[0],"Implementations":[1],"of":[2,17,40,58],"loopless":[3],"k":[4],"shortest":[5,27],"path":[6],"algorithms":[7],"are":[8,19],"examined.":[9],"Efficient":[10],"storage":[11],"structures":[12],"for":[13,24,55],"a":[14,38],"large":[15],"number":[16],"paths":[18,28,59],"given.":[20],"A":[21],"fast":[22],"algorithm":[23],"determining":[25],"the":[26,47,56],"in":[29],"Yen's":[30,43],"method":[31],"is":[32,45],"developed.":[33],"Timing":[34],"experiments":[35],"show":[36],"that":[37],"hybrid":[39],"Clarke's":[41],"and":[42],"methods":[44],"generally":[46],"fastest,":[48],"although":[49],"not":[50],"significantly.":[51],"Using":[52],"upper":[53],"bounds":[54],"lengths":[57],"essentially":[60],"improves":[61],"all":[62],"methods.":[63]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1931114878","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-01-06T14:11:43.857249","created_date":"2016-06-24"}