Efficient partitioning algorithms for optimizing big graph computation

DOI10.1007/978-981-96-1093-8_17MaRDI QIDQ6955129zbMATH OpenFDO

Authors Baoling Ning, Yupeng Gao

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1093-8_17

zbMATH Keywords

bi-criteria approximation algorithmgraph partitioningsemidefinite programming

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Balanced graph partitioning
• Balanced partitions of trees and applications
• Divide-and-conquer approximation algorithms via spreading metrics
• Expander flows, geometric embeddings and graph partitioning
• Fast Approximate Graph Partitioning Algorithms
• How Good is Recursive Bisection?
• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Partitioning graphs into balanced components
• Some simplified NP-complete graph problems

This page was built for publication: Efficient partitioning algorithms for optimizing big graph computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955129)