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žené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 50; číslo 1; s. 4
Hlavní autori:	Yu, Junran, Hu, Jing, Gao, Jiaquan, Du, Donglei, Zhang, Xiaoyan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2025 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!