Abstract
We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimiz......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
