A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

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 $\texttt{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 $\texttt{EIS}$ works correctly even if the exact value of $q$ is unknown. Despite its simplicity, $\texttt{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.

[1]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[2]  Roberto Grossi,et al.  Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques , 2016, ICALP.

[3]  Takeaki Uno,et al.  Constant Time Enumeration by Amortization , 2015, WADS.

[4]  D. R. Lick,et al.  k-Degenerate Graphs , 1970, Canadian Journal of Mathematics.

[5]  George Manoussakis,et al.  A new decomposition technique for maximal clique enumeration for sparse graphs , 2019, Theor. Comput. Sci..

[6]  Hiroki Arimura,et al.  Efficient Enumeration of Dominating Sets for Sparse Graphs , 2018, ISAAC.

[7]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[8]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[9]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[10]  Yehoshua Sagiv,et al.  Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties , 2008, J. Comput. Syst. Sci..

[11]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[12]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[13]  Roberto Grossi,et al.  Listing Maximal Independent Sets with Minimal Space and Bounded Delay , 2017, SPIRE.

[14]  Hiroki Arimura,et al.  Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph , 2014, ISAAC.

[15]  Stephan Kreutzer,et al.  Characterisations of Nowhere Dense Graphs (Invited Talk) , 2013, FSTTCS.

[16]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[17]  Hiroki Arimura,et al.  Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four , 2018, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[18]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[19]  Joseph Y.-T. Leung,et al.  Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.

[20]  Small Maximal Independent Sets and Faster Exact Graph Coloring , 2003 .

[21]  Marthe Bonamy,et al.  Enumerating minimal dominating sets in triangle-free graphs , 2019, STACS.

[22]  Richard Beigel,et al.  Finding maximum independent sets in sparse and general graphs , 1999, SODA '99.

[23]  Roberto Grossi,et al.  Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs , 2014, ESA.

[24]  Sumio Masuda,et al.  Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph , 1992, J. Algorithms.

[25]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[26]  Roberto Grossi,et al.  Optimal Listing of Cycles and st-Paths in Undirected Graphs , 2012, SODA.

[27]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[28]  Takeaki Uno,et al.  New polynomial delay bounds for maximal subgraph enumeration by proximity search , 2019, STOC.

[29]  Roberto Grossi,et al.  Listing Maximal Subgraphs Satisfying Strongly Accessible Properties , 2019, SIAM J. Discret. Math..

[30]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[31]  Takeaki Uno,et al.  Efficient Enumeration of Bipartite Subgraphs in Graphs , 2018, COCOON.

[32]  Yoshio Okamoto,et al.  Counting the number of independent sets in chordal graphs , 2008, J. Discrete Algorithms.

[33]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..