Arman, Nabil; Khamayseh, Faisal
(International Journal of Electrical and Computer Engineering (IJECE), 2015-09-01)
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 ...