Evolutionary multi-level acyclic graph partitioning

Moreira, Orlando; Popp, Merten; Schulz, Christian

doi:10.1007/s10732-020-09448-8

Cited by 9 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the input instance is a directed acyclic graph (DAG), one is often interested in finding a partition with an acyclic quotient graph. Moreira et al [148] show that perfectly balanced graph partitioning is NP-complete even under the additional acyclicity constraint, and that there are no constant-factor approximation algorithms for 𝑘 ≥ 3. Herrmann et al [98,99] and Moreira et al [148] both propose multilevel heuristics for DAG partitioning.…”

Section: Directed Acyclic (Hyper)graphmentioning

confidence: 99%

“…Moreira et al [148] show that perfectly balanced graph partitioning is NP-complete even under the additional acyclicity constraint, and that there are no constant-factor approximation algorithms for 𝑘 ≥ 3. Herrmann et al [98,99] and Moreira et al [148] both propose multilevel heuristics for DAG partitioning. Popp et al [162] adapt these techniques to directed acyclic hypergraph partitioning.…”

Section: Directed Acyclic (Hyper)graphmentioning

confidence: 99%

“…Moreira et al [148] coarsen the graph using size-constraint label propagation [143]. Since this algorithm is not adapted to DAGs, contracting the computed clusters creates coarse graphs with cycles.…”

Section: Directed Acyclic (Hyper)graphmentioning

confidence: 99%

See 2 more Smart Citations

More Recent Advances in (Hyper)Graph Partitioning

Çatalyürek¹,

Devine²,

Faraj³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical algorithms for balanced (hyper)graph partitioning together with future research directions. Our work serves as an update to a previous survey on the topic [34]. In particular, the survey extends the previous survey by also covering hypergraph partitioning and streaming algorithms, and has an additional focus on parallel algorithms.

show abstract