Counting Small Induced Subgraphs with Edge-Monotone Properties-Reference-Cited by-同舟云学术

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

Counting Small Induced Subgraphs with Edge-Monotone Properties

Published:2024-06-10 Issue: Volume: Page:1517-1525
ISSN:
Container-title:Proceedings of the 56th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Döring Simon¹^ORCID,Marx Dániel²^ORCID,Wellnitz Philip³^ORCID

Affiliation:

1. Max Planck Institute for Informatics, Saarbrücken, Germany / Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany / Saarland Informatics Campus, Saarbrücken, Germany

2. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany

3. Max Planck Institute for Informatics, Saarbrücken, Germany / Saarland Informatics Campus, Saarbrücken, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3618260.3649644

Reference24 articles.

1. Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

2. Counting Matchings of Size k Is $\sharp$ W[1]-Hard

3. Homomorphisms are a good basis for counting small subgraphs

4. Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts

5. Parameterized Algorithms

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP