当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Subexponential algorithms for variants of the homomorphism problem in string graphs
Journal of Computer and System Sciences ( IF 1.129 ) Pub Date : 2019-12-30 , DOI: 10.1016/j.jcss.2019.12.004
Karolina Okrasa; Paweł Rzążewski

We consider subexponential algorithms finding weighted homomorphisms from intersection graphs of curves (string graphs) with n vertices to a fixed graph H. We provide a complete dichotomy: if H has no two vertices sharing two common neighbors, then the problem can be solved in time 2O(n2/3log⁡n), otherwise there is no subexponential algorithm, assuming the ETH. Then we consider locally constrained homomorphisms. We show that for each target graph H, the locally injective and locally bijective homomorphism problems can be solved in time 2O(nlog⁡n) in string graphs. For locally surjective homomorphisms we show a dichotomy for H being a path or a cycle. If H is P3 or C4, then the problem can be solved in time 2O(n2/3log3/2⁡n) in string graphs; otherwise, assuming the ETH, there is no subexponential algorithm. As corollaries, we obtain new results concerning the complexity of homomorphism problems in Pt-free graphs.
更新日期:2020-01-04

 

全部期刊列表>>
宅家赢大奖
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
深圳大学二维材料实验室张晗
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug