KaFFPa

swMATH6271MaRDI QIDQ18402FDOQ18402

Author name not available (Why is that?)

Cited In (26)

• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
• Energy-optimal routes for battery electric vehicles
• Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
• Candidate sets for alternative routes in road networks
• An exact combinatorial algorithm for minimum graph bisection
• Leveraging special-purpose hardware for local search heuristics
• Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs
• Memetic Graph Clustering
• A two-level graph partitioning problem arising in mobile wireless communications
• Parallel remeshing of unstructured volume grids for CFD applications
• Distributed Evolutionary Graph Partitioning
• Column-generation based bounds for the homogeneous areas problem
• A bounded-error quantum polynomial-time algorithm for two graph bisection problems
• Employee workload balancing by graph partitioning
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Engineering Multilevel Graph Partitioning Algorithms
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• An exact approach for the multi-constraint graph partitioning problem
• Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
• Title not available (Why is that?)
• Linear-Time Approximation for Maximum Weight Matching
• Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
• The parallel finite element system M++ with integrated multilevel preconditioning and multilevel Monte Carlo methods
• Worst-case analysis of clique MIPs
• Advanced coarsening schemes for graph partitioning
• A scalable parallel factorization of finite element matrices with distributed Schur complements

This page was built for software: KaFFPa