{"id":"https://openalex.org/W2000836066","doi":"https://doi.org/10.1109/iccsn.2010.97","title":"Two Phase Shortest Path Algorithm for Non-negative Weighted Undirected Graphs","display_name":"Two Phase Shortest Path Algorithm for Non-negative Weighted Undirected Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2000836066","doi":"https://doi.org/10.1109/iccsn.2010.97","mag":"2000836066"},"language":"en","primary_location":{"id":"doi:10.1109/iccsn.2010.97","doi":"https://doi.org/10.1109/iccsn.2010.97","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccsn.2010.97","pdf_url":null,"source":{"id":"https://openalex.org/S4306418661","display_name":"IEEE International Conference on Communication Software and Networks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Second International Conference on Communication Software and Networks","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5091812586","display_name":"Muhammad Aasim Qureshi","orcid":"https://orcid.org/0000-0002-6312-5797","observed_orcids":["https://orcid.org/0000-0002-6312-5797"]},"institutions":[{"id":"https://openalex.org/I203899302","display_name":"Universiti Teknologi Petronas","ror":"https://ror.org/048g2sh07","country_code":"MY","type":"education","lineage":["https://openalex.org/I203899302"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Muhammad Aasim Qureshi","raw_affiliation_strings":["Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]},{"raw_affiliation_string":"Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079884366","display_name":"Mohd Fadzil Hassan","orcid":"https://orcid.org/0000-0001-9912-6890","observed_orcids":["https://orcid.org/0000-0001-9912-6890"]},"institutions":[{"id":"https://openalex.org/I203899302","display_name":"Universiti Teknologi Petronas","ror":"https://ror.org/048g2sh07","country_code":"MY","type":"education","lineage":["https://openalex.org/I203899302"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Mohd Fadzil Hassan","raw_affiliation_strings":["Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]},{"raw_affiliation_string":"Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108348567","display_name":"Sohail Safdar","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I203899302","display_name":"Universiti Teknologi Petronas","ror":"https://ror.org/048g2sh07","country_code":"MY","type":"education","lineage":["https://openalex.org/I203899302"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Sohail Safdar","raw_affiliation_strings":["Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]},{"raw_affiliation_string":"Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044145790","display_name":"Rehan Akbar","orcid":"https://orcid.org/0000-0002-3703-5974","observed_orcids":["https://orcid.org/0000-0002-3703-5974"]},"institutions":[{"id":"https://openalex.org/I203899302","display_name":"Universiti Teknologi Petronas","ror":"https://ror.org/048g2sh07","country_code":"MY","type":"education","lineage":["https://openalex.org/I203899302"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Rehan Akbar","raw_affiliation_strings":["Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Science Department, Universiti Teknologi Petronas, Bandar Seri Iskandar, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]},{"raw_affiliation_string":"Comput. & Inf. Sci. Dept., Univ. Technologi PETRONAS, Perak, Malaysia","institution_ids":["https://openalex.org/I203899302"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I203899302"],"apc_list":null,"apc_paid":null,"fwci":1.8097,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83028932,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1373","issue":null,"first_page":"223","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9872999787330627,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9872999787330627,"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.012000000104308128,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.828000009059906},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.9409999847412109},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"breadth-first search","score":0.7590000033378601},{"id":"https://openalex.org/keywords/two-stage-algorithm","display_name":"two-stage algorithm","score":0.6990000009536743},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.5059999823570251}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.714414656162262},{"id":"https://openalex.org/C2778826181","wikidata":"https://www.wikidata.org/wiki/Q3310538","display_name":"Culprit","level":3,"score":0.6620116233825684},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.6530836820602417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.606768786907196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.601924479007721},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5998054146766663},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5945767760276794},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5338678359985352},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5056734085083008},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4996044635772705},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4939308762550354},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.37284499406814575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36144882440567017},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3285948634147644},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.28872695565223694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2722221314907074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17769378423690796},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09984061121940613},{"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/C500558357","wikidata":"https://www.wikidata.org/wiki/Q12152","display_name":"Myocardial infarction","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C118552586","wikidata":"https://www.wikidata.org/wiki/Q7867","display_name":"Psychiatry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccsn.2010.97","doi":"https://doi.org/10.1109/iccsn.2010.97","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccsn.2010.97","pdf_url":null,"source":{"id":"https://openalex.org/S4306418661","display_name":"IEEE International Conference on Communication Software and Networks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Second International Conference on Communication Software and Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W143880785","https://openalex.org/W199160990","https://openalex.org/W1511146167","https://openalex.org/W1599325086","https://openalex.org/W1978757752","https://openalex.org/W1993675440","https://openalex.org/W1999545213","https://openalex.org/W2010802092","https://openalex.org/W2018338704","https://openalex.org/W2074286662","https://openalex.org/W2075543862","https://openalex.org/W2083669067","https://openalex.org/W2084224084","https://openalex.org/W2087932760","https://openalex.org/W2129776415","https://openalex.org/W2160365857","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2741557789","https://openalex.org/W2917658449","https://openalex.org/W2953252390","https://openalex.org/W6645059220"],"related_works":["https://openalex.org/W2087932760","https://openalex.org/W2953252390","https://openalex.org/W2102755248","https://openalex.org/W2358741943","https://openalex.org/W2164297487","https://openalex.org/W7033888682","https://openalex.org/W2074250490","https://openalex.org/W2358732346","https://openalex.org/W1985676638","https://openalex.org/W2027580688"],"abstract_inverted_index":{"Abstract-Breadth":[0],"First":[1],"Search":[2],"(BFS)":[3],"can":[4],"calculate":[5],"the":[6,48],"shortest":[7,54],"path":[8,55],"for":[9],"un-weighted":[10],"graphs":[11,21],"very":[12],"efficiently":[13],"but":[14],"when":[15,27],"it":[16,22],"comes":[17],"to":[18,72],"non-negative":[19],"weighted":[20],"fails":[23],"at":[24],"a":[25,28,31,117],"point":[26],"successor":[29],"updates":[30,91],"predecessor.":[32],"Such":[33],"nodes":[34,40,46,71,85,96,104],"are":[35,47,77,92,105],"being":[36,106],"referred":[37],"as":[38],"Culprit":[39,45,70],"in":[41,53,56,108],"this":[42,132],"research.":[43],"These":[44],"ones":[49],"that":[50,59],"cause":[51],"error":[52],"an":[57],"algorithm":[58,122,133],"traverses":[60],"like":[61],"BFS.":[62],"This":[63],"research":[64],"targets":[65],"on":[66,94],"recognizing":[67],"and":[68,79,114],"marking":[69],"disengage":[73],"them":[74],"until":[75,88],"they":[76],"properly":[78],"completely":[80],"updated.":[81],"Processing":[82],"through":[83],"such":[84],"is":[86],"postponed":[87],"all":[89,98],"possible":[90,99],"made":[93],"these":[95],"nullifying":[97],"chances":[100],"of":[101],"errors.":[102],"As":[103],"traversed":[107],"BFS":[109],"fashion":[110],"with":[111],"few":[112],"violations":[113],"additions":[115],"promising":[116],"O(k(|V|":[118],"+":[119,127],"|E|))":[120],"time":[121],"where":[123],"0":[124],"<":[125],"k":[126],"log":[128],"n.":[129],"More":[130],"over":[131],"does":[134],"not":[135],"need":[136],"any":[137],"complex":[138],"data":[139],"structure.":[140]},"counts_by_year":[],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2016-06-24T00:00:00"}