{"id":"https://openalex.org/W1499819666","doi":null,"title":"A hybrid algorithm for finding shortest path in network routing.","display_name":"A hybrid algorithm for finding shortest path in network routing.","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W1499819666","mag":"1499819666"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.506.8157","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.506.8157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jatit.org/volumes/research-papers/Vol5No3/14Vol5No3.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5068243609","display_name":"Mohammad Reza Soltan Aghaei","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohammad Reza Soltan Aghaei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056464097","display_name":"Zuriati Ahmad Zukarnain","orcid":"https://orcid.org/0000-0003-2408-6956","observed_orcids":["https://orcid.org/0000-0003-2408-6956"]},"institutions":[{"id":"https://openalex.org/I130343225","display_name":"Universiti Putra Malaysia","ror":"https://ror.org/02e91jd64","country_code":"MY","type":"education","lineage":["https://openalex.org/I130343225"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Zuriati Ahmad Zukarnain","raw_affiliation_strings":["UNIVERSITI PUTRA MALAYSIA"],"raw_orcid":"https://orcid.org/0000-0003-2408-6956","affiliations":[{"raw_affiliation_string":"UNIVERSITI PUTRA MALAYSIA","institution_ids":["https://openalex.org/I130343225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112102249","display_name":"Ali Mamat","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130343225","display_name":"Universiti Putra Malaysia","ror":"https://ror.org/02e91jd64","country_code":"MY","type":"education","lineage":["https://openalex.org/I130343225"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Ali Mamat","raw_affiliation_strings":["UNIVERSITI PUTRA MALAYSIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNIVERSITI PUTRA MALAYSIA","institution_ids":["https://openalex.org/I130343225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062441549","display_name":"Hishamuddin Zainuddin","orcid":"https://orcid.org/0000-0002-5131-4419","observed_orcids":["https://orcid.org/0000-0002-5131-4419"]},"institutions":[{"id":"https://openalex.org/I130343225","display_name":"Universiti Putra Malaysia","ror":"https://ror.org/02e91jd64","country_code":"MY","type":"education","lineage":["https://openalex.org/I130343225"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Hishamuddin Zainuddin","raw_affiliation_strings":["UNIVERSITI PUTRA MALAYSIA"],"raw_orcid":"https://orcid.org/0000-0002-5131-4419","affiliations":[{"raw_affiliation_string":"UNIVERSITI PUTRA MALAYSIA","institution_ids":["https://openalex.org/I130343225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048178571","display_name":"Asstt Prof","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asstt Prof","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9911,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.79222702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.986299991607666,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.986299991607666,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.010599999688565731,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.00039999998989515007,"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/shortest-path","display_name":"shortest path","score":0.968999981880188},{"id":"https://openalex.org/keywords/network-routing","display_name":"network routing","score":0.9750000238418579},{"id":"https://openalex.org/keywords/quantum-search-algorithms","display_name":"quantum search","score":0.8100000023841858},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9129999876022339},{"id":"https://openalex.org/keywords/hybrid-quantum-classical-algorithms","display_name":"hybrid quantum-classical algorithms","score":0.8629999756813049},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.6790000200271606},{"id":"https://openalex.org/keywords/graph-search","display_name":"graph search","score":0.531000018119812}],"concepts":[{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7368983030319214},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.710792601108551},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.70014488697052},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6852213144302368},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6529560089111328},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6041539907455444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5565283298492432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4912647604942322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4756217300891876},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.47305288910865784},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4515383541584015},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3640221357345581},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.337647020816803},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.32821395993232727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3104705810546875},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10910576581954956},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.506.8157","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.506.8157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jatit.org/volumes/research-papers/Vol5No3/14Vol5No3.pdf","raw_type":"text"},{"id":"pmh:oai:psasir.upm.edu.my:12706","doi":null,"is_oa":false,"landing_page_url":"http://psasir.upm.edu.my/id/eprint/12706/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196260","display_name":"Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130343225","host_organization_name":"Universiti Putra Malaysia","host_organization_lineage":["https://openalex.org/I130343225"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"mag:1499819666","doi":null,"is_oa":false,"landing_page_url":"http://www.jatit.org/volumes/research-papers/Vol5No3/14Vol5No3.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1483489440","https://openalex.org/W1519302393","https://openalex.org/W2002372750","https://openalex.org/W2006290558","https://openalex.org/W2050334794","https://openalex.org/W2079092820","https://openalex.org/W2084652510","https://openalex.org/W2134514766","https://openalex.org/W3023478445"],"related_works":["https://openalex.org/W2150814707","https://openalex.org/W7167885926","https://openalex.org/W7171734908","https://openalex.org/W2284438909","https://openalex.org/W6966517456","https://openalex.org/W2096469076","https://openalex.org/W4403007005","https://openalex.org/W1976438756","https://openalex.org/W2943735369","https://openalex.org/W2162915498"],"abstract_inverted_index":{"Classical":[0],"algorithms":[1,114],"have":[2],"been":[3],"used":[4,38,89],"to":[5,68],"search":[6],"over":[7],"some":[8],"space":[9],"for":[10,28,83,93,112,125],"finding":[11,94],"the":[12,43,57,99,110,117,121,133,142],"shortest":[13,95],"paths":[14],"problem":[15,97],"between":[16],"two":[17],"points":[18],"in":[19,98],"a":[20,23,48],"network":[21,102],"and":[22,103,115,127,137],"minimal":[24],"weight":[25],"spanning":[26],"tree":[27],"routing.":[29],"Any":[30],"classical":[31,90,126],"algorithm":[32,55,60,82,92,124,140],"deterministic":[33],"or":[34],"probabilistic":[35,122,143],"will":[36,46],"clearly":[37],"O(N)":[39],"steps":[40,80],"since":[41],"on":[42],"average":[44],"it":[45],"measure":[47],"large":[49],"fraction":[50],"of":[51,101,120,135],"N":[52,78],"records.":[53],"Quantum":[54],"is":[56],"fastest":[58],"possible":[59],"that":[61,85],"can":[62],"do":[63],"several":[64],"operations":[65],"simultaneously":[66],"due":[67],"their":[69],"wave":[70,74],"like":[71],"properties.":[72],"This":[73],"gives":[75],"an":[76],"O(":[77],")":[79],"quantum":[81,105,128],"identifying":[84],"record,":[86],"where":[87],"was":[88],"Dijkstra\u2019s":[91],"path":[96],"graph":[100],"implement":[104],"search.":[106],"Also":[107],"we":[108,131],"proposed":[109],"structure":[111],"non-classical":[113],"design":[116],"various":[118],"phases":[119],"quantum-classical":[123,144],"parts.":[129],"Finally,":[130],"represent":[132],"result":[134],"implementing":[136],"simulating":[138],"Dijkstra's":[139],"as":[141],"algorithm.":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}