{"id":"https://openalex.org/W2138546253","doi":"https://doi.org/10.2200/s00245ed1v01y201001cnt003","title":"Path Problems in Networks","display_name":"Path Problems in Networks","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2138546253","doi":"https://doi.org/10.2200/s00245ed1v01y201001cnt003","mag":"2138546253"},"language":"en","primary_location":{"id":"doi:10.2200/s00245ed1v01y201001cnt003","is_oa":true,"landing_page_url":"https://doi.org/10.2200/s00245ed1v01y201001cnt003","pdf_url":"https://link.springer.com/content/pdf/bfm%3A978-3-031-79983-9%2F1","source":{"id":"https://openalex.org/S4210169685","display_name":"Synthesis lectures on communication networks","issn_l":"1935-4185","issn":["1935-4185","1935-4193"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322570","host_organization_name":"Morgan & Claypool Publishers","host_organization_lineage":["https://openalex.org/P4310322570"],"host_organization_lineage_names":["Morgan & Claypool Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Synthesis Lectures on Communication Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/bfm%3A978-3-031-79983-9%2F1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044395526","display_name":"John S. Baras","orcid":"https://orcid.org/0000-0002-4955-8561"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John S. Baras","raw_affiliation_strings":["University of Maryland, USA","University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042246090","display_name":"George Theodorakopoulos","orcid":"https://orcid.org/0000-0003-2701-7809"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"George Theodorakopoulos","raw_affiliation_strings":["\u00c9cole Polytechnique Federale, Lausanne, Switzerland","\u00c9cole Polytechnique, F\u00e9d\u00e9rale de Lausanne#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique Federale, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"\u00c9cole Polytechnique, F\u00e9d\u00e9rale de Lausanne#TAB#","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4694,"has_fulltext":true,"cited_by_count":61,"citation_normalized_percentile":{"value":0.9475182,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"3","issue":"1","first_page":"1","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9957000017166138,"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/generalization","display_name":"Generalization","score":0.7604302167892456},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7408686876296997},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.7046512365341187},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6884539127349854},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5177159309387207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4694119393825531},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4172557294368744},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.41267022490501404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4055979549884796},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3880632519721985},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36538922786712646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31573474407196045},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1207539439201355},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05362841486930847}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7604302167892456},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7408686876296997},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7046512365341187},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6884539127349854},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5177159309387207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4694119393825531},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4172557294368744},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.41267022490501404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4055979549884796},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3880632519721985},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36538922786712646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31573474407196045},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1207539439201355},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05362841486930847},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2200/s00245ed1v01y201001cnt003","is_oa":true,"landing_page_url":"https://doi.org/10.2200/s00245ed1v01y201001cnt003","pdf_url":"https://link.springer.com/content/pdf/bfm%3A978-3-031-79983-9%2F1","source":{"id":"https://openalex.org/S4210169685","display_name":"Synthesis lectures on communication networks","issn_l":"1935-4185","issn":["1935-4185","1935-4193"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322570","host_organization_name":"Morgan & Claypool Publishers","host_organization_lineage":["https://openalex.org/P4310322570"],"host_organization_lineage_names":["Morgan & Claypool Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Synthesis Lectures on Communication Networks","raw_type":"journal-article"},{"id":"pmh:oai:https://orca.cardiff.ac.uk:92110","is_oa":false,"landing_page_url":"https://orca.cardiff.ac.uk/id/eprint/92110/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book"}],"best_oa_location":{"id":"doi:10.2200/s00245ed1v01y201001cnt003","is_oa":true,"landing_page_url":"https://doi.org/10.2200/s00245ed1v01y201001cnt003","pdf_url":"https://link.springer.com/content/pdf/bfm%3A978-3-031-79983-9%2F1","source":{"id":"https://openalex.org/S4210169685","display_name":"Synthesis lectures on communication networks","issn_l":"1935-4185","issn":["1935-4185","1935-4193"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322570","host_organization_name":"Morgan & Claypool Publishers","host_organization_lineage":["https://openalex.org/P4310322570"],"host_organization_lineage_names":["Morgan & Claypool Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Synthesis Lectures on Communication Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2138546253.pdf","grobid_xml":"https://content.openalex.org/works/W2138546253.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W27433529","https://openalex.org/W53596869","https://openalex.org/W566622251","https://openalex.org/W1481156553","https://openalex.org/W1497177773","https://openalex.org/W1560267311","https://openalex.org/W1584941324","https://openalex.org/W1588115473","https://openalex.org/W1603765807","https://openalex.org/W1964119857","https://openalex.org/W1983301762","https://openalex.org/W1991466857","https://openalex.org/W2004354110","https://openalex.org/W2012634103","https://openalex.org/W2029778575","https://openalex.org/W2039634593","https://openalex.org/W2049091111","https://openalex.org/W2053299990","https://openalex.org/W2092144207","https://openalex.org/W2099236627","https://openalex.org/W2100415265","https://openalex.org/W2105738468","https://openalex.org/W2105761946","https://openalex.org/W2107551402","https://openalex.org/W2125528794","https://openalex.org/W2132642300","https://openalex.org/W2135300639","https://openalex.org/W2136834963","https://openalex.org/W2143658255","https://openalex.org/W2144532599","https://openalex.org/W2156523427","https://openalex.org/W2157921329","https://openalex.org/W2159018822","https://openalex.org/W2159256070","https://openalex.org/W2168205742","https://openalex.org/W2169528473","https://openalex.org/W2171697943","https://openalex.org/W2227557434","https://openalex.org/W2334315458","https://openalex.org/W2613173048","https://openalex.org/W2752885492","https://openalex.org/W2911246871","https://openalex.org/W2974116768","https://openalex.org/W3145128584","https://openalex.org/W4206085413","https://openalex.org/W4241850027","https://openalex.org/W4247726752","https://openalex.org/W4252569161"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2353519994","https://openalex.org/W2163326490","https://openalex.org/W4321491762","https://openalex.org/W2386835479","https://openalex.org/W2384965074","https://openalex.org/W1974495461","https://openalex.org/W2392417690","https://openalex.org/W2469944050","https://openalex.org/W2138546253"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}