{"id":"https://openalex.org/W2163179118","doi":"https://doi.org/10.1109/iske.2008.4730916","title":"An efficient algorithm for the Single-Source Shortest Path Problem in graph theory","display_name":"An efficient algorithm for the Single-Source Shortest Path Problem in graph theory","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W2163179118","doi":"https://doi.org/10.1109/iske.2008.4730916","mag":"2163179118"},"language":"en","primary_location":{"id":"doi:10.1109/iske.2008.4730916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iske.2008.4730916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 3rd International Conference on Intelligent System and Knowledge Engineering","raw_type":"proceedings-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/A5070559820","display_name":"Tianrui Li","orcid":"https://orcid.org/0000-0001-7780-104X"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tianrui Li","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102162983","display_name":"Luole Qi","orcid":null},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luole Qi","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104092668","display_name":"Da Ruan","orcid":null},"institutions":[{"id":"https://openalex.org/I32597200","display_name":"Ghent University","ror":"https://ror.org/00cv9y106","country_code":"BE","type":"education","lineage":["https://openalex.org/I32597200"]},{"id":"https://openalex.org/I4210114391","display_name":"Belgian Nuclear Research Centre","ror":"https://ror.org/020xs5r81","country_code":"BE","type":"facility","lineage":["https://openalex.org/I4210114391"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Da Ruan","raw_affiliation_strings":["Belgian Nuclear Research Center, Mol, Belgium","Department of Applied Math & Computer Science, Ghent University, Ghent, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Belgian Nuclear Research Center, Mol, Belgium","institution_ids":["https://openalex.org/I4210114391"]},{"raw_affiliation_string":"Department of Applied Math & Computer Science, Ghent University, Ghent, Belgium","institution_ids":["https://openalex.org/I32597200"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7605,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.75099381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"152","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9957000017166138,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8113890886306763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6416181921958923},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6378777623176575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.585361123085022},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5729897022247314},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5125781893730164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3946273922920227},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3246856927871704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3093494474887848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2869434952735901}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8113890886306763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6416181921958923},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6378777623176575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.585361123085022},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5729897022247314},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5125781893730164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3946273922920227},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3246856927871704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3093494474887848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2869434952735901}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iske.2008.4730916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iske.2008.4730916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 3rd International Conference on Intelligent System and Knowledge Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:archive.ugent.be:2918879","is_oa":false,"landing_page_url":"https://biblio.ugent.be/publication/2918879","pdf_url":null,"source":{"id":"https://openalex.org/S4306400478","display_name":"Ghent University Academic Bibliography (Ghent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I32597200","host_organization_name":"Ghent University","host_organization_lineage":["https://openalex.org/I32597200"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISBN: 9781424421961","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319077","display_name":"Society for the Study of School Psychology","ror":"https://ror.org/00gz9xf10"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1986955201","https://openalex.org/W1990678352","https://openalex.org/W2068758895","https://openalex.org/W2108063157","https://openalex.org/W2118169763","https://openalex.org/W2227557434","https://openalex.org/W2330022088","https://openalex.org/W3004540582","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2990531685","https://openalex.org/W2886722595","https://openalex.org/W2578319993","https://openalex.org/W2761711678","https://openalex.org/W2375661673","https://openalex.org/W2170980056","https://openalex.org/W2379804627","https://openalex.org/W4221129498","https://openalex.org/W4310124294","https://openalex.org/W2359532380"],"abstract_inverted_index":{"The":[0,52,65],"Single-Source":[1],"Shortest":[2],"Path":[3],"problem":[4],"(SSSP),":[5],"known":[6],"as":[7],"the":[8,57,60,63,72,76,81,91,99,103,113,118,123,127,132],"basis":[9],"of":[10,40,59,112,126],"many":[11],"application":[12],"areas,":[13],"is":[14,31,54,105],"a":[15,24,37,45],"fundamental":[16],"matter":[17],"in":[18],"graph":[19],"theory.":[20],"In":[21],"this":[22,69],"paper,":[23],"new":[25],"efficient":[26],"algorithm":[27,53,78,100,120,129,134],"named":[28],"Li-Qi":[29],"(LQ)":[30],"proposed":[32,119],"for":[33],"SSSP":[34],"to":[35,49],"find":[36],"simple":[38],"path":[39],"minimum":[41],"total":[42],"weights":[43],"from":[44],"designated":[46],"source":[47,92],"vertex":[48,93],"each":[50],"vertex.":[51],"based":[55],"on":[56,109],"ideas":[58],"queue":[61,104],"and":[62,75,89,94,130],"relaxation,":[64],"main":[66],"differences":[67],"between":[68],"strategy":[70],"with":[71],"Breadth-first":[73],"search":[74],"Bellman-Ford":[77,133],"are":[79,97],"that":[80,117],"vertices":[82,96],"may":[83],"be":[84],"queued":[85],"more":[86],"than":[87],"once":[88],"only":[90],"relaxed":[95],"queued;":[98],"terminates":[101],"when":[102],"empty.":[106],"Experimental":[107],"evaluation":[108],"different":[110],"sizes":[111],"generated":[114],"graphs":[115],"validates":[116],"far":[121],"outperforms":[122],"simplest":[124],"implementation":[125],"Dijkstra\u2019s":[128],"surpasses":[131],"by":[135],"about":[136],"2":[137],"times.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}