7 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
M. Yusuf Özkaya, Ümit V. Çatalyürek
This work addresses the NP-Hard problem of acyclic directed acyclic graph (DAG) partitioning problem. The acyclic partitioning problem is defined as partitioning the vertex set of…