Research on Layering Algorithm of DAG
Hai Rong Tang, Shihong Chen · 2008
We consider the problem of partitioning a directed acyclic graph into layers such that all edges point the same directionally. We perform an experimental analysis of some of the existing layering algorithm. Then we propose simplex algorithm based on linear programming to layering a graph. The goal is to minimize the total sum of edge span so that the layered graph has a smaller area than other algorithms.