{"id":"https://openalex.org/W7162094108","doi":"https://doi.org/10.48550/arxiv.2605.22149","title":"A Coalgebraic Dijkstra Algorithm","display_name":"A Coalgebraic Dijkstra Algorithm","publication_year":2026,"publication_date":"2026-05-21","ids":{"openalex":"https://openalex.org/W7162094108","doi":"https://doi.org/10.48550/arxiv.2605.22149"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.22149","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22149","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.22149","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102431340","display_name":"Takahiro Sanada","orcid":"https://orcid.org/0000-0003-3409-6963"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanada, Takahiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084952945","display_name":"Yo\u00e0v Montacute","orcid":"https://orcid.org/0000-0001-9814-7323"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Montacute, Yo\u00e0v","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025393237","display_name":"Kittiphon Phalakarn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Phalakarn, Kittiphon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013382452","display_name":"Ichiro Hasuo","orcid":"https://orcid.org/0000-0002-8300-4650"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hasuo, Ichiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"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":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3107999861240387,"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.3107999861240387,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.15389999747276306,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.12970000505447388,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7921000123023987},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6331999897956848},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6169000267982483},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.60589998960495},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5476999878883362},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5181000232696533},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.475600004196167}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7921000123023987},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6331999897956848},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6169000267982483},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.60589998960495},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5476999878883362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5218999981880188},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5181000232696533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5116000175476074},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.475600004196167},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4284000098705292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4165000021457672},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.39899998903274536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36419999599456787},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.319599986076355},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.2669000029563904},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2639999985694885},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.25690001249313354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.22149","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22149","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.22149","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22149","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Dijkstra":[1,22,83,134],"algorithm":[2,84,102,124],"is":[3,96,116],"a":[4,46,50,81,91,109],"classical":[5,133],"method":[6],"for":[7,26,32,49,85,100,112],"solving":[8,86],"the":[9,21,27,40,64,73,87,101,122,132],"shortest":[10,42,74],"path":[11,29,43],"problem":[12,30,44],"on":[13,56],"weighted":[14],"graphs.":[15],"There":[16],"are":[17],"several":[18],"variations":[19],"of":[20,53,131],"algorithm,":[23],"including":[24],"algorithms":[25],"widest":[28],"and":[31,98],"two-player":[33],"games.":[34],"In":[35],"this":[36],"paper,":[37],"we":[38],"introduce":[39],"coalgebraic":[41,82],"(CSPP),":[45],"unifying":[47],"framework":[48,60],"broad":[51],"class":[52],"optimization":[54],"problems":[55,66],"state-transition":[57],"systems.":[58],"This":[59],"encompasses":[61],"not":[62],"only":[63],"aforementioned":[65],"but":[67],"also":[68,119],"new":[69],"ones":[70],"such":[71],"as":[72],"binary":[75],"tree":[76],"problem.":[77],"We":[78,118],"further":[79],"present":[80],"CSPP":[88],"efficiently":[89],"under":[90],"suitable":[92],"condition.":[93],"Our":[94],"condition":[95],"necessary":[97],"sufficient":[99],"to":[103,129],"return":[104],"correct":[105],"solutions,":[106],"thereby":[107],"providing":[108],"precise":[110],"criterion":[111],"when":[113],"Dijkstra-style":[114],"acceleration":[115],"possible.":[117],"show":[120],"that":[121,130],"proposed":[123],"achieves":[125],"asymptotic":[126],"complexity":[127],"comparable":[128],"algorithm.":[135]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-23T00:00:00"}