8 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 3 cited
Evolutionary Acyclic Graph Partitioning
Orlando Moreira, Merten Popp, Christian Schulz
Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the probl…
cs.DS2017★ 8 cited
Graph Partitioning with Acyclicity Constraints
Orlando Moreira, Merten Popp, Christian Schulz
Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention…