{"id":"https://openalex.org/W2892546229","doi":"https://doi.org/10.1109/icis.2018.8466444","title":"A New Algorithm to Compute Single Source Shortest Path in a Real Edge Weighted Graph to Optimize Time Complexity","display_name":"A New Algorithm to Compute Single Source Shortest Path in a Real Edge Weighted Graph to Optimize Time Complexity","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2892546229","doi":"https://doi.org/10.1109/icis.2018.8466444","mag":"2892546229"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2018.8466444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5040768177","display_name":"Faheem Ahmed","orcid":"https://orcid.org/0000-0002-5436-1966"},"institutions":[],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Fahim Ahmed","raw_affiliation_strings":["Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070234004","display_name":"Fahim Anzum","orcid":"https://orcid.org/0000-0002-1846-3957"},"institutions":[],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Fahim Anzum","raw_affiliation_strings":["Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046681246","display_name":"Muhammad Nazrul Islam","orcid":"https://orcid.org/0000-0002-7189-4879"},"institutions":[],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Muhammad Nazrul Islam","raw_affiliation_strings":["Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081036583","display_name":"Wali Mohammad Abdullah","orcid":"https://orcid.org/0000-0003-1523-7628"},"institutions":[],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Wali Mohammad Abdullah","raw_affiliation_strings":["Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050285645","display_name":"Sazid Al Ahsan","orcid":null},"institutions":[],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Sazid Al Ahsan","raw_affiliation_strings":["Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022432490","display_name":"Moneruzzaman Rana","orcid":null},"institutions":[],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Moneruzzaman Rana","raw_affiliation_strings":["Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Military Institute of Science and Technology (MIST), Dhaka, Bangladesh","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.367,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"citation_normalized_percentile":{"value":0.514696,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":74,"max":77},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"191"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9978,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9978,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9917,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9901,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5646729},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.48311162},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.47494152}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7417873},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.70645255},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.68338007},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.67279834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5861134},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5646729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.52229905},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.49991012},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.48311162},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.47494152},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47164863},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4454075},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.43395945},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41279343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38187554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26433483},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07531953}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2018.8466444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W2000940915","https://openalex.org/W2032865436","https://openalex.org/W2050147082","https://openalex.org/W2074792936","https://openalex.org/W2092330486","https://openalex.org/W2102503266","https://openalex.org/W2123425929","https://openalex.org/W2124651399","https://openalex.org/W2133794215","https://openalex.org/W2768149714","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2597144308","https://openalex.org/W2381419702","https://openalex.org/W2381351584","https://openalex.org/W2358661218","https://openalex.org/W2352589493","https://openalex.org/W2348287729","https://openalex.org/W2100214387"],"abstract_inverted_index":{"A":[0],"prime":[1],"concern":[2],"of":[3,24,32,80,97],"a":[4,130],"Shortest-Path":[5],"problem":[6,76],"is":[7,17,62],"to":[8,70,87],"handle":[9,41],"any":[10],"real":[11,67],"edge":[12,68],"weight":[13,26,43,82],"values":[14],"whether":[15],"it":[16],"positive":[18],"or":[19],"negative":[20,25,42,81],"with":[21,53,66,77,103,114,125,129],"the":[22,46,78,106,119,126],"feature":[23,79],"cycle":[27,83],"detection":[28,84],"if":[29],"exists.":[30],"Number":[31],"single":[33,72],"source":[34,73],"shortest-path":[35],"algorithms":[36],"are":[37],"available":[38],"that":[39,122],"can":[40],"cycle,":[44],"where":[45],"most":[47],"stable":[48],"algorithm":[49,61,108,121],"till":[50],"date":[51],"executes":[52],"polynomial":[54,131],"time":[55,89,92,116,132],"complexity.":[56,90,133],"In":[57],"this":[58],"paper,":[59],"an":[60],"proposed":[63,107],"for":[64,101],"graphs":[65],"weights":[69],"solve":[71],"shortest":[74],"path":[75],"in":[85],"order":[86],"optimize":[88],"The":[91],"complexity":[93,117],"analysis":[94],"and":[95,111],"proof":[96],"correctness":[98],"confirmed":[99],"that,":[100],"graph":[102],"identical":[104],"configuration,":[105],"provides":[109],"faster":[110],"accurate":[112],"solutions":[113],"quasilinear":[115],"than":[118],"existing":[120],"comes":[123],"out":[124],"same":[127],"solution":[128]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2892546229","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-01-17T01:32:58.360967","created_date":"2018-10-05"}