Fair Splitting of Colored Paths
[摘要] This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each color.
[发布日期] [发布机构]
[效力级别] [学科分类] 离散数学和组合数学
[关键词] Independent sets;Necklace splitting;Octahedral Tucker lemma [时效性]
