Evolutionary n-level hypergraph partitioning with adaptive coarsening
(2019)
Journal Article
Hypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems. Current techniques use a multilevel appro... Read More about Evolutionary n-level hypergraph partitioning with adaptive coarsening.