Search Results for author:
Found 2 papers, 0 papers with code
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
