{"id":"https://openalex.org/W4381744868","doi":"https://doi.org/10.1109/noms56928.2023.10154322","title":"Generic Dijkstra: correctness and tractability","display_name":"Generic Dijkstra: correctness and tractability","publication_year":2023,"publication_date":"2023-05-08","ids":{"openalex":"https://openalex.org/W4381744868","doi":"https://doi.org/10.1109/noms56928.2023.10154322"},"language":"en","primary_location":{"id":"doi:10.1109/noms56928.2023.10154322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms56928.2023.10154322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium","raw_type":"proceedings-article"},"type":"conference-paper","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/A5025696272","display_name":"Ireneusz Szcze\u015bniak","orcid":"https://orcid.org/0000-0002-5760-5022"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ireneusz Szcze\u015bniak","raw_affiliation_strings":["Częstochowa University of Technology,Department of Computer Science ul. J. H. Dąbrowskiego 73,Częstochowa,Poland,42-201"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Częstochowa University of Technology,Department of Computer Science ul. J. H. Dąbrowskiego 73,Częstochowa,Poland,42-201","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040200686","display_name":"Bo\u017cena Wo\u017ana-Szcze\u015bniak","orcid":"https://orcid.org/0000-0002-1486-6572"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bo\u017cena Wo\u017ana-Szcze\u015bniak","raw_affiliation_strings":["Jan Długosz University in Częstochowa,Department of Mathematics and Computer Science al. Armii Krajowej 13/15,Częstochowa,Poland,42-200"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jan Długosz University in Częstochowa,Department of Mathematics and Computer Science al. Armii Krajowej 13/15,Częstochowa,Poland,42-200","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9879999756813049,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9879999756813049,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9866999983787537,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8173748254776001},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8070685863494873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7329813838005066},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4113420248031616},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35609933733940125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10569906234741211},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.10003873705863953}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8173748254776001},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8070685863494873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7329813838005066},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4113420248031616},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35609933733940125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10569906234741211},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.10003873705863953}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/noms56928.2023.10154322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms56928.2023.10154322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323573","display_name":"Ministry of Education and Science","ror":"https://ror.org/053pcb396"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1517411378","https://openalex.org/W1977545325","https://openalex.org/W2051956023","https://openalex.org/W2056653303","https://openalex.org/W2165751335","https://openalex.org/W2611823500","https://openalex.org/W3034470660","https://openalex.org/W3104214067","https://openalex.org/W3198709614","https://openalex.org/W4285092328"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W1604988569"],"abstract_inverted_index":{"The":[0,15,35],"recently-proposed":[1],"generic":[2],"Dijkstra":[3],"algorithm":[4,16,36,64],"finds":[5],"shortest":[6,113],"paths":[7],"in":[8,19,88,115],"networks":[9,29],"with":[10,30,45,76,118],"continuous":[11],"and":[12,32,44,54,125],"contiguous":[13],"resources.":[14,34],"was":[17,37],"proposed":[18],"the":[20,59,63,68,82,85,89,93,123],"context":[21],"of":[22,42,71,84,106],"optical":[23],"networks,":[24],"but":[25],"is":[26,96],"applicable":[27],"to":[28,58,73,122],"finite":[31],"discrete":[33,119],"published":[38],"without":[39],"a":[40,46,56,77,102,112,116],"proof":[41,53],"correctness,":[43],"minor":[47],"shortcoming.":[48,60],"We":[49],"provide":[50],"that":[51],"missing":[52],"offer":[55],"correction":[57],"To":[61],"prove":[62],"correct,":[65],"we":[66,91,99,108,129],"generalize":[67],"Bellman\u2019s":[69],"principle":[70],"optimality":[72],"algebraic":[74],"structures":[75],"partial":[78],"ordering.":[79],"By":[80],"analyzing":[81],"size":[83],"search":[86],"space":[87],"worst-case,":[90],"argue":[92],"stated":[94],"problem":[95],"tractable.":[97],"Thus":[98],"definitely":[100],"answer":[101],"longstanding":[103],"fundamental":[104],"question":[105],"whether":[107],"can":[109],"efficienlty":[110],"find":[111],"path":[114],"network":[117],"resources":[120],"subject":[121],"continuity":[124],"contiguity":[126],"constraints:":[127],"yes,":[128],"can.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2023-06-24T00:00:00"}