Neighbourhood complexity of graphs of bounded twin-width

Author:

Bonnet Édouard,Foucaud Florent,Lehtilä Tuomo,Parreau Aline

Funder

ANR

Academy of Finland

Suomen Kulttuurirahasto

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference30 articles.

1. Vapnik–Chervonenkis density in some theories without the independence property, II;Aschenbrenner;Notre Dame J. Formal Logic,2013

2. Vapnik–Chervonenkis density in some theories without the independence property, I;Aschenbrenner;Trans. Amer. Math. Soc.,2016

3. Parameterized and approximation complexity of Partial VC Dimension;Bazgan;Theoret. Comput. Sci.,2019

4. Twin-width VIII: delineation and win-wins;Bonnet,2022

5. Twin-width III: max independent set, min dominating set, and coloring;Bonnet,2021

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Neighborhood Complexity of Planar Graphs;Combinatorica;2024-06-24

2. Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Flip-width: Cops and Robber on dense graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3