Search Results for author:
Found 3 papers, 0 papers with code
Multilevel Acyclic Hypergraph Partitioning
The acyclic hypergraph partitioning problem is to partition the hypernodes of a directed acyclic hypergraph into a given number of blocks of roughly equal size such that the corresponding quotient graph is acyclic while minimizing an objective function on the partition.
Evolutionary Acyclic Graph Partitioning
Directed graphs are widely used to model data flow and execution dependencies in streaming applications.
Graph Partitioning with Acyclicity Constraints
In this work, we show that this more constrained version of the graph partitioning problem is NP-complete and present heuristics that achieve a close approximation of the optimal solution found by an exhaustive search for small problem instances and much better scalability for larger instances.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
