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

Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k -partition problem. This paper leverages the charity vertex method and proposes several algorithms for 2-balanced vertex-connected partitioning. Furthermore, w...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 50; no. 1; p. 4
Main Authors:	Yu, Junran, Hu, Jing, Gao, Jiaquan, Du, Donglei, Zhang, Xiaoyan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2025 Springer Nature B.V
Subjects:	Algorithms Approximation Codes Combinatorics Convex and Discrete Geometry Graphs Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Theory of Computation Trees (mathematics) Charity vertex Balanced connected partition Graph vertex partition algorithm
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!