Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs
- Casel, Katrin
- Issac, Davis
- Niklanovits, Aikaterini
- Schwartz, Stephan
- Zeif, Ziena
Publication date
January 2021
DOI Publisher
LIPIcs - Leibniz International Proceedings in Informatics. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021) Language
EnglishAbstract
w_k. In particular for the balanced version, i.e. w? = w? == w_k, this gives a partition with 1/3w_i ? w(T_i) ? 3w_i
Add to ORKG