当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On Fine-Grained Exact Computation in Regular Graphs
arXiv - CS - Computational Complexity Pub Date : 2020-08-20 , DOI: arxiv-2008.09008
Saeed Akhoondian Amiri

We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in $d$-regular graphs, for any constant $d>2$, unless ETH fails. We also discuss the extensions of our construction to other problems and other classes of graphs, including $5$-regular planar graphs.

中文翻译:

关于正则图中的细粒度精确计算

我们表明,对于任何常数 $d>2$,除非 ETH 失败,否则没有次指数时间算法可用于计算 $d$-正则图中最大独立集问题的精确解。我们还讨论了我们的构造对其他问题和其他类别的图的扩展,包括 $5$-regular 平面图。
更新日期:2020-08-21
down
wechat
bug