{"id":"https://openalex.org/W1804733508","doi":"https://doi.org/10.11591/ijece.v5i4.pp772-781","title":"A Path-Compression Approach for Improving Shortest-Path Algorithms","display_name":"A Path-Compression Approach for Improving Shortest-Path Algorithms","alternate_titles":[],"publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W1804733508","doi":"https://doi.org/10.11591/ijece.v5i4.pp772-781","mag":"1804733508"},"language":"en","primary_location":{"id":"doi:10.11591/ijece.v5i4.pp772-781","doi":"https://doi.org/10.11591/ijece.v5i4.pp772-781","is_oa":true,"landing_page_url":"https://doi.org/10.11591/ijece.v5i4.pp772-781","pdf_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/5672/4639","source":{"id":"https://openalex.org/S2764532672","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","issn_l":"2088-8708","issn":["2088-8708"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310315009","host_organization_name":"Institute of Advanced Engineering and Science (IAES)","host_organization_lineage":["https://openalex.org/P4310315009"],"host_organization_lineage_names":["Institute of Advanced Engineering and Science (IAES)"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE)","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W1804733508"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/5672/4639","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071664339","display_name":"Nabil Arman","orcid":"https://orcid.org/0000-0002-7815-7150","observed_orcids":["https://orcid.org/0000-0002-7815-7150"]},"institutions":[{"id":"https://openalex.org/I37417134","display_name":"Palestine Polytechnic University","ror":"https://ror.org/03wwspn40","country_code":"PS","type":"education","lineage":["https://openalex.org/I37417134"]}],"countries":["PS"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Nabil Arman","raw_affiliation_strings":["Palestine Polytechnic University\r\nHebron","Palestine Polytechnic University#R##N#Hebron"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Palestine Polytechnic University\r\nHebron","institution_ids":["https://openalex.org/I37417134"]},{"raw_affiliation_string":"Palestine Polytechnic University#R##N#Hebron","institution_ids":["https://openalex.org/I37417134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025119929","display_name":"Faisal T. Khamayseh","orcid":"https://orcid.org/0009-0002-6485-0891","observed_orcids":["https://orcid.org/0009-0002-6485-0891"]},"institutions":[{"id":"https://openalex.org/I37417134","display_name":"Palestine Polytechnic University","ror":"https://ror.org/03wwspn40","country_code":"PS","type":"education","lineage":["https://openalex.org/I37417134"]}],"countries":["PS"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Faisal Khamayseh","raw_affiliation_strings":["Palestine Polytechnic University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Palestine Polytechnic University","institution_ids":["https://openalex.org/I37417134"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025119929"],"corresponding_institution_ids":["https://openalex.org/I37417134"],"apc_list":null,"apc_paid":null,"fwci":0.5434,"has_fulltext":true,"cited_by_count":10,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.58636664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":"5","issue":"4","first_page":"772","last_page":"772"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9496999979019165,"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.9496999979019165,"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.049300000071525574,"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.0008999999845400453,"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.7440000176429749},{"id":"https://openalex.org/keywords/path-compression","display_name":"path compression","score":0.9909999966621399},{"id":"https://openalex.org/keywords/weighted-directed-graphs","display_name":"weighted directed graphs","score":0.8949999809265137},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.8709999918937683},{"id":"https://openalex.org/keywords/graph-compression","display_name":"graph compression","score":0.6019999980926514},{"id":"https://openalex.org/keywords/critical-nodes","display_name":"critical nodes","score":0.32100000977516174}],"concepts":[{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.6384468078613281},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6104992628097534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5715407729148865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5375226736068726},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5232906937599182},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.49765852093696594},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.47893840074539185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44270098209381104},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.42750874161720276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.379450261592865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36733323335647583},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3195030093193054},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2871316075325012},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27435216307640076},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.26804161071777344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24508163332939148}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.11591/ijece.v5i4.pp772-781","doi":"https://doi.org/10.11591/ijece.v5i4.pp772-781","is_oa":true,"landing_page_url":"https://doi.org/10.11591/ijece.v5i4.pp772-781","pdf_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/5672/4639","source":{"id":"https://openalex.org/S2764532672","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","issn_l":"2088-8708","issn":["2088-8708"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310315009","host_organization_name":"Institute of Advanced Engineering and Science (IAES)","host_organization_lineage":["https://openalex.org/P4310315009"],"host_organization_lineage_names":["Institute of Advanced Engineering and Science (IAES)"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE)","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.11591/ijece.v5i4.pp772-781","doi":"https://doi.org/10.11591/ijece.v5i4.pp772-781","is_oa":true,"landing_page_url":"https://doi.org/10.11591/ijece.v5i4.pp772-781","pdf_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/5672/4639","source":{"id":"https://openalex.org/S2764532672","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","issn_l":"2088-8708","issn":["2088-8708"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310315009","host_organization_name":"Institute of Advanced Engineering and Science (IAES)","host_organization_lineage":["https://openalex.org/P4310315009"],"host_organization_lineage_names":["Institute of Advanced Engineering and Science (IAES)"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE)","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322457","display_name":"Palestine Polytechnic University","ror":"https://ror.org/03wwspn40"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1804733508.pdf","grobid_xml":"https://content.openalex.org/works/W1804733508.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W205563241","https://openalex.org/W1766902571","https://openalex.org/W1978144076","https://openalex.org/W1995811559","https://openalex.org/W2094724468","https://openalex.org/W2095941092","https://openalex.org/W2169528473","https://openalex.org/W2183033961","https://openalex.org/W2942018599","https://openalex.org/W4237695434","https://openalex.org/W7100614001"],"related_works":["https://openalex.org/W762596760","https://openalex.org/W7099880763","https://openalex.org/W7215398980","https://openalex.org/W2624291017","https://openalex.org/W2811421397","https://openalex.org/W1817899449","https://openalex.org/W2926263662","https://openalex.org/W1699659737","https://openalex.org/W4236475946","https://openalex.org/W9296126"],"abstract_inverted_index":{"Given":[0],"a":[1,14,32,62,94],"weighted":[2],"directed":[3],"graph":[4,15,29,77,81,92,120,129],"G=(V;E;w),":[5],"where":[6],"w":[7],"is":[8,13,52,89,130],"non-negative":[9],"weight":[10],"function,":[11],"G\u2019":[12],"obtained":[16],"from":[17],"G":[18,30],"by":[19,60],"an":[20],"application":[21],"of":[22,35,43,49,68,86],"path":[23,55],"compression.":[24],"Path":[25],"compression":[26],"reduces":[27,66],"the":[28,41,76,87,91,119,128],"to":[31,72],"critical":[33],"set":[34],"vertices":[36,59,106],"and":[37,107,132],"edges":[38],"that":[39,65,70,96],"affect":[40],"generation":[42],"shortest":[44,54],"trees.":[45],"The":[46,83],"main":[47,84],"contribution":[48],"this":[50],"paper":[51],"finding":[53],"between":[56],"two":[57],"selected":[58],"applying":[61],"new":[63],"algorithm":[64,88,116],"number":[67],"nodes":[69,99],"needs":[71],"be":[73],"traversed":[74],"in":[75,93],"while":[78,102],"preserving":[79],"all":[80,103],"properties.":[82,114],"method":[85],"restructuring":[90],"way":[95],"only":[97],"critical/relevant":[98],"are":[100,109],"considered":[101],"other":[104],"neutral":[105],"weights":[108],"preserved":[110],"as":[111],"sub":[112],"paths'":[113],"Our":[115],"can":[117],"compress":[118],"paths":[121],"into":[122],"considerable":[123],"improved":[124],"percentage":[125],"especially":[126],"when":[127],"sparse":[131],"hence":[133],"improves":[134],"performance":[135],"significantly.":[136]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1804733508","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-19T14:11:59.513116","created_date":"2016-06-24T00:00:00"}
