Multilevel algorithms for acyclic partitioning of directed acyclic graphs
DOI10.1137/18M1176865zbMATH Open1418.05108MaRDI QIDQ5230645FDOQ5230645
Authors: Julien Herrmann, M. Yusuf Özkaya, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek 
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2084263
- Graph partitioning with acyclicity constraints
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A partitioning requiring rapidity and quality: the multilevel method and partitions refinement algorithms
- \(n\)-level graph partitioning
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The University of Florida sparse matrix collection
- Benchmarking optimization software with performance profiles.
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch-and-bound algorithm for the acyclic partitioning problem
- Fast (structured) Newton computations
- Optimal Sequential Partitions of Graphs
- Engineering multilevel graph partitioning algorithms
- Multilevel refinement for combinatorial optimisation problems
- Parallelism in structured Newton computations
- Automatic differentiation in MATLAB using ADMAT with applications
- On characterizing the data access complexity of programs
- Graph partitioning with acyclicity constraints
Cited In (3)
Uses Software
This page was built for publication: Multilevel algorithms for acyclic partitioning of directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230645)
