On the DAG Decomposition
Yangjun Chen & Yibin Chen · Journal of Advances in Mathematics and Computer Science · 2015
In this paper, we propose an efficient algorithm to decompose a directed acyclic graph 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 f...
Open access
Research Article
10.9734/BJMCS/2015/19380