Title :
On the Graph Decomposition
Author :
Yangjun Chen ; Yibin Chen
Author_Institution :
Dept. Appl. Comput. Sci., Univ. of Winnipeg, Winnipeg, MB, Canada
Abstract :
In this paper, we propose an efficient algorithm to decompose a directed acyclic graph (DAG) G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now needs O(n3) time, where n is the number of the nodes of G.
Keywords :
computational complexity; directed graphs; DAG; O(n3) time; directed acyclic graph; node-disjoint chains; Algorithm design and analysis; Big data; Bipartite graph; Cloud computing; Conferences; Indexes; Time complexity; directed graphs; reachability queries; transitive closure;
Conference_Titel :
Big Data and Cloud Computing (BdCloud), 2014 IEEE Fourth International Conference on
Conference_Location :
Sydney, NSW
DOI :
10.1109/BDCloud.2014.118
