On Fine-Grained Exact Computation in Regular Graphs

08/20/2020 ∙ by Saeed Akhoondian Amiri, et al. ∙ 0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.