Directed Acyclic Graph Partitioning
碩士 === 元智大學 === 資訊工程學系 === 95 === In this thesis we study the directed acyclic graph (DAG) partitioning problem. Given a DAG, divide the DAG into disjoint groups such that the number of groups is minimized, subject to the following constraints: (1) no feedback loop exists among the groups, (2) the n...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73821828301512633165 |