Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering
Nabil Arman
Palestine Polytechnic University Hebron
Computer Science & IT Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : International Journal of Electrical and Computer Engineering

 1 
A Path-Compression Approach for Improving Shortest-Path Algorithms Nabil Arman; Faisal Khamayseh
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 4: August 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (232.692 KB) | DOI: 10.11591/ijece.v5i4.pp772-781

Abstract

Given a weighted directed graph G=(V;E;w), where w is non-negative weight function, G’ is a graph obtained from G by an application of path compression. Path compression reduces the graph G to a critical set of vertices and edges that affect the generation of shortest trees. The main contribution of this paper is finding shortest path between two selected vertices by applying a new algorithm that reduces number of nodes that needs to be traversed in the graph while preserving all graph properties.  The main method of the algorithm is restructuring the graph in a way that only critical/relevant nodes are considered while all other neutral vertices and weights are preserved as sub paths' properties.  Our algorithm can compress the graph paths into considerable improved percentage especially when the graph is sparse and hence improves performance significantly.
Co-Authors Faisal Khamayseh