{"id":"https://openalex.org/W1586244921","doi":"https://doi.org/10.1609/socs.v2i1.18191","title":"Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm","display_name":"Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm","publication_year":2021,"publication_date":"2021-08-19","ids":{"openalex":"https://openalex.org/W1586244921","doi":"https://doi.org/10.1609/socs.v2i1.18191","mag":"1586244921"},"language":"en","primary_location":{"id":"doi:10.1609/socs.v2i1.18191","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v2i1.18191","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18191/17982","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18191/17982","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Ben-Gurion University","BEN GURION UNIVERSITY"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"BEN GURION UNIVERSITY","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011195666"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":2.3115,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.89936574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"47","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9929999709129333,"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/T11439","display_name":"Video Analysis and Summarization","score":0.9919000267982483,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.9428131580352783},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7453266978263855},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6026570796966553},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5868327021598816},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5715702176094055},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5560653209686279},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5283340215682983},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5256173014640808},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5166130661964417},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.43677830696105957},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.43648505210876465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3066653311252594},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2889089286327362}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9428131580352783},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7453266978263855},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6026570796966553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5868327021598816},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5715702176094055},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5560653209686279},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5283340215682983},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5256173014640808},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5166130661964417},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.43677830696105957},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.43648505210876465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3066653311252594},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2889089286327362},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/socs.v2i1.18191","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v2i1.18191","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18191/17982","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/socs.v2i1.18191","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v2i1.18191","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18191/17982","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1586244921.pdf","grobid_xml":"https://content.openalex.org/works/W1586244921.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1517411378","https://openalex.org/W1996805805","https://openalex.org/W2102323131","https://openalex.org/W2169528473","https://openalex.org/W2753176400","https://openalex.org/W2897365112","https://openalex.org/W3137299218","https://openalex.org/W3145128584","https://openalex.org/W3183881215","https://openalex.org/W4285092328","https://openalex.org/W6675587209","https://openalex.org/W6685290738","https://openalex.org/W7029321148","https://openalex.org/W7037065903"],"related_works":["https://openalex.org/W4281943708","https://openalex.org/W4383900343","https://openalex.org/W3015233512","https://openalex.org/W2385737134","https://openalex.org/W3124075993","https://openalex.org/W2136320479","https://openalex.org/W2514247065","https://openalex.org/W3216780016","https://openalex.org/W2355399587","https://openalex.org/W1985118543"],"abstract_inverted_index":{"Dijkstra's":[0],"single-source":[1],"shortest-path":[2],"algorithm":[3],"(DA)":[4],"is":[5,19,28,38,61,70,88,97],"one":[6],"of":[7,32],"the":[8,33,48,95],"well-known,":[9],"fundamental":[10],"algorithms":[11,50],"in":[12,22,65,90],"computer":[13],"science":[14],"and":[15,51,55,74,78,92,107,110],"related":[16],"fields.":[17],"DA":[18,64,87],"commonly":[20],"taught":[21,89],"undergraduate":[23],"courses.":[24],"Uniform-cost":[25],"search":[26,35],"(UCS)":[27],"a":[29],"simple":[30],"version":[31],"best-first":[34],"scheme":[36],"which":[37],"logically":[39],"equivalent":[40],"to":[41,63,72,104],"DA.":[42],"In":[43],"this":[44],"paper":[45],"I":[46,57,101],"compare":[47],"two":[49],"show":[52],"their":[53],"similarities":[54],"differences.":[56],"claim":[58],"that":[59,86],"UCS":[60,113],"superior":[62],"almost":[66],"all":[67],"aspects.":[68],"It":[69],"easier":[71],"understand":[73],"implement.":[75],"Its":[76],"time":[77],"memory":[79],"needs":[80],"are":[81],"also":[82],"smaller.":[83],"The":[84],"reason":[85],"universities":[91],"classes":[93],"around":[94],"world":[96],"probably":[98],"only":[99],"historical.":[100],"encourage":[102],"people":[103],"stop":[105],"using":[106],"teaching":[108],"DA,":[109],"focus":[111],"on":[112],"only.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}