KaFFPa
From MaRDI portal
Cited in
(54)- Employee workload balancing by graph partitioning
- Parallel remeshing of unstructured volume grids for CFD applications
- Leveraging special-purpose hardware for local search heuristics
- Multilevel algorithms for acyclic partitioning of directed acyclic graphs
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Distributed Evolutionary Graph Partitioning
- A two-level graph partitioning problem arising in mobile wireless communications
- Column-generation based bounds for the homogeneous areas problem
- Advanced coarsening schemes for graph partitioning
- Worst-case analysis of clique MIPs
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Candidate sets for alternative routes in road networks
- An exact combinatorial algorithm for minimum graph bisection
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
- Linear-time approximation for maximum weight matching
- SNAP
- An exact approach for the multi-constraint graph partitioning problem
- SNAP
- JOSTLE
- Bubble-FOS/C
- LPAm+
- Scotch
- VNDS
- DibaP
- PaToH
- hMETIS
- CMU Benchmarks
- libPTScotch
- Parkway
- DryadOpt
- Pregel
- PowerGraph
- Energy-optimal routes for battery electric vehicles
- KaHIP
- kMetis
- SCLaP
- PARTY
- KaHyPar
- M++
- SGTlight
- BSPedupack
- LocalGraphClustering
- PushRelabelMaxFlow
- Python-Louvain
- HyperX
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
- Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
- Efficient implementation of a synchronous parallel push-relabel algorithm
- Memetic graph clustering
- The parallel finite element system M++ with integrated multilevel preconditioning and multilevel Monte Carlo methods
- scientific article; zbMATH DE number 7286677 (Why is no real title available?)
- Engineering multilevel graph partitioning algorithms
- A scalable parallel factorization of finite element matrices with distributed Schur complements.
This page was built for software: KaFFPa
