{"id":"https://openalex.org/W4382116996","doi":"https://doi.org/10.1007/s10922-023-09738-z","title":"Two Algorithms for the k-Widest Path Problem","display_name":"Two Algorithms for the k-Widest Path Problem","publication_year":2023,"publication_date":"2023-06-26","ids":{"openalex":"https://openalex.org/W4382116996","doi":"https://doi.org/10.1007/s10922-023-09738-z"},"language":"en","primary_location":{"id":"doi:10.1007/s10922-023-09738-z","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s10922-023-09738-z","pdf_url":null,"source":{"id":"https://openalex.org/S67072002","display_name":"Journal of Network and Systems Management","issn_l":"1064-7570","issn":["1064-7570","1573-7705"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Network and Systems Management","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/A5062640364","display_name":"Teresa Gomes","orcid":"https://orcid.org/0000-0002-3084-5608"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Teresa Gomes","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","Department of Electrical and Computer Engineering, University of Coimbra, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Coimbra, Portugal","Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Coimbra, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]},{"raw_affiliation_string":"Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037870241","display_name":"L\u00facia Martins","orcid":"https://orcid.org/0000-0002-6534-0159"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"L\u00facia Martins","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","Department of Electrical and Computer Engineering, University of Coimbra, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Coimbra, Portugal","Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Coimbra, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]},{"raw_affiliation_string":"Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051112019","display_name":"Jos\u00e9 Craveirinha","orcid":"https://orcid.org/0000-0001-8562-3730"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Jos\u00e9 M. F. Craveirinha","raw_affiliation_strings":["Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Coimbra, Portugal","Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]},{"raw_affiliation_string":"Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra), DEEC, Rua S\u00edlvio Lima, Polo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071674500","display_name":"Deep Medhi","orcid":"https://orcid.org/0000-0003-4109-0658"},"institutions":[{"id":"https://openalex.org/I1311060795","display_name":"U.S. National Science Foundation","ror":"https://ror.org/021nxhr62","country_code":"US","type":"government","lineage":["https://openalex.org/I1311060795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Deep Medhi","raw_affiliation_strings":["Computer and Network Systems Division, National Science Foundation, Alexandria, 22314, VA, USA","Computer and Network Systems Division, National Science Foundation, Alexandria, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Network Systems Division, National Science Foundation, Alexandria, 22314, VA, USA","institution_ids":["https://openalex.org/I1311060795"]},{"raw_affiliation_string":"Computer and Network Systems Division, National Science Foundation, Alexandria, USA","institution_ids":["https://openalex.org/I1311060795"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037870241","https://openalex.org/A5051112019","https://openalex.org/A5062640364","https://openalex.org/A5071674500"],"corresponding_institution_ids":["https://openalex.org/I1311060795","https://openalex.org/I4210125590","https://openalex.org/I76903346"],"apc_list":{"value":2790,"currency":"USD","value_usd":2790},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04004641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9975000023841858,"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.9975000023841858,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9919000267982483,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9832000136375427,"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.8337717056274414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6892602443695068},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6410261392593384},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6407682299613953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6064474582672119},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5654028058052063},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5208078622817993},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5205770134925842},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5122618079185486},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4726116955280304},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.44809937477111816},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4382566213607788},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3984304666519165},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.29268789291381836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2745152711868286},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.17230674624443054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17108508944511414},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15453305840492249},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05639120936393738}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8337717056274414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6892602443695068},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6410261392593384},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6407682299613953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6064474582672119},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5654028058052063},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5208078622817993},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5205770134925842},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5122618079185486},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4726116955280304},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.44809937477111816},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4382566213607788},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3984304666519165},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.29268789291381836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2745152711868286},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.17230674624443054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17108508944511414},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15453305840492249},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05639120936393738}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10922-023-09738-z","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s10922-023-09738-z","pdf_url":null,"source":{"id":"https://openalex.org/S67072002","display_name":"Journal of Network and Systems Management","issn_l":"1064-7570","issn":["1064-7570","1573-7705"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Network and Systems Management","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7258438060","display_name":"Institute for Systems Engineering and Computers at Coimbra - INESC Coimbra","funder_award_id":"UIDB/00308/2020","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1982444805","https://openalex.org/W2011282943","https://openalex.org/W2085830191","https://openalex.org/W2096774592","https://openalex.org/W2107609237","https://openalex.org/W2112643276","https://openalex.org/W2133228819","https://openalex.org/W2496424549","https://openalex.org/W2613070411","https://openalex.org/W3046728914"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2198982833","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W2776102956","https://openalex.org/W2020255949","https://openalex.org/W2369379323","https://openalex.org/W2106784610"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}