Algorithms for 2-balanced connected k-partition problem in graphs

DOI10.1007/S10878-025-01332-0MaRDI QIDQ6956309zbMATH OpenFDO

Authors Junran Yu, Jing Hu, Jiaquan Gao, Donglei Du, Xiaoyan Zhang

Publication date 18 July 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01332-0

zbMATH Keywords

balanced connected partitioncharity vertexgraph vertex partition algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A homology theory for spanning tress of a graph
• A Little Charity Guarantees Almost Envy-Freeness
• A tight bound on the min-ratio edge-partitioning problem of a tree
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Approximation algorithms for maximally balanced connected graph partition
• Approximation algorithms for the maximally balanced connected graph tripartition problem
• Approximation and inaproximability results on balanced connected partitions of graphs
• Graph theory
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• Most uniform path partitioning and its use in image processing
• On the complexity of finding multi-constrained spanning trees
• On the complexity of partitioning graphs into connected subgraphs

This page was built for publication: Algorithms for 2-balanced connected \(k\)-partition problem in graphs

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