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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of combinatorial optimization Ročník 50; číslo 1; s. 4
Hlavní autoři: Yu, Junran, Hu, Jing, Gao, Jiaquan, Du, Donglei, Zhang, Xiaoyan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2025
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-025-01332-0