DeepAI AI Chat

On Fine-Grained Exact Computation in Regular Graphs

08/20/2020

∙

by Saeed Akhoondian Amiri, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

∙ 05/31/2022

On the coset graph construction of distance-regular graphs

We show that no more new distance-regular graphs in the tables of the bo...

0 Minjia Shi, et al. ∙

∙ 06/22/2015

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

We consider a natural restriction of the List Colouring problem: k-Regul...

0 Konrad K. Dabrowski, et al. ∙

∙ 07/29/2019

A new record of enumeration of regular graphs by parallel processing

We broke a record, set 8 years ago, in the enumeration of non-isomorphic...

0 Zhipeng Xu, et al. ∙

∙ 12/01/2019

PACLP: a fine-grained partition-based access control policy language for provenance

Even though the idea of partitioning provenance graphs for access contro...

0 Faen Zhang, et al. ∙

∙ 07/29/2019

Enumeration of regular graphs by using the cluster in high efficiency

In this note, we proposed a method to enumerate regular graphs on the cl...

0 Zhipeng Xu, et al. ∙

∙ 08/30/2019

Existence of d-regular nut graphs for d at most 11

A nut graph is a singular graph with one-dimensional kernel and correspo...

0 Patrick W. Fowler, et al. ∙

∙ 08/26/2019

Breadth-first search on a Ramanujan graph

The behavior of the randomized breadth-first search algorithm is analyze...

0 Janko Boehm, et al. ∙