Solving Partition Problems Almost Always Requires Pushing Many Vertices Around-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Published:2020-01 Issue:1 Volume:34 Page:640-681
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Kanj Iyad,Komusiewicz Christian,Sorge Manuel,van Leeuwen Erik Jan

Funder

Deutsche Forschungsgemeinschaft

H2020 European Research Council

Research Executive Agency

Seventh Framework Programme

Israel Science Foundation

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

https://epubs.siam.org/doi/pdf/10.1137/19M1239362

Reference26 articles.

1. Partitioning a graph into disjoint cliques and a triangle-free graph

2. The complexity of G-free colourability

3. Kernelization Lower Bounds by Cross-Composition

4. The complexity of partitioning into disjoint cliques and a triangle-free graph

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP