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

Junran Yu, Jing Hu, Jiaquan Gao, Donglei Du and Xiaoyan Zhang ()
Additional contact information
Junran Yu: Nanjing Normal University
Jing Hu: Nanjing Normal University
Jiaquan Gao: Nanjing Normal University
Donglei Du: University of New Brunswick
Xiaoyan Zhang: Nanjing Normal University

Journal of Combinatorial Optimization, 2025, vol. 50, issue 1, No 4, 19 pages

Abstract: Abstract 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, we prove that these algorithms are polynomial-time solvable on degree-bounded graphs, thereby refining and extending the results of Caragiannis et al.

Keywords: Graph vertex partition algorithm; Charity vertex; Balanced connected partition (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01332-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01332-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01332-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().