DeepAI AI Chat
Log In Sign Up

Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number

by   Kazuhiro Kurita, et al.
National Institute of Informatics
Hokkaido University

In this study, we address the independent set enumeration problem. Although several efficient enumeration algorithms and careful analyses have been proposed for maximal independent sets, no fine-grained analysis has been given for the non-maximal variant. From the main result, we propose an algorithm EIS for the non-maximal variant that runs in O(q) amortized time and linear space, where q is the clique number, i.e., the maximum size of a clique in an input graph. Note that EIS works correctly even if the exact value of q is unknown. Despite its simplicity, EIS is optimal for graphs with a bounded clique number, such as, triangle-free graphs, planar graphs, bounded degenerate graphs, locally bounded expansion graphs, and F-free graphs for any fixed graph F, where a F-free graph is a graph that has no copy of F as a subgraph.


Exact recovery of Planted Cliques in Semi-random graphs

In this paper, we study the Planted Clique problem in a semi-random mode...

Detecting strong cliques

A strong clique in a graph is a clique intersecting every maximal indepe...

Termination of Multipartite Graph Series Arising from Complex Network Modelling

An intense activity is nowadays devoted to the definition of models capt...

Clustering powers of sparse graphs

We prove that if G is a sparse graph — it belongs to a fixed class of bo...

Fairness-aware Maximal Clique Enumeration

Cohesive subgraph mining on attributed graphs is a fundamental problem i...

The Power of Pivoting for Exact Clique Counting

Clique counting is a fundamental task in network analysis, and even the ...