Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices

In this paper, we address the independent set enumeration problem. Although many efficient enumeration algorithms for maximal independent sets have been proposed, no fine-grained analysis for the non-maximal variant has not been given. As the main result, we propose an algorithm \texttt{EIS} for the non-maximal variant that runs in amortized $O(q)$ time and liner space, where $q$ is the maximum integer such that there is no clique with $q$ vertices in the given graph. Note that \texttt{EIS} correctly works even if we do not know the exact value of $q$. In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique, e.g., triangle-free graphs, planer graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on. Hence, as a by product, \texttt{EIS} is optimal when input graphs are in a graph class with forbidden subgraphs on fixed number of vertices.

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

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

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

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

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

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

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

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

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

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

[11]  David Eppstein,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2011, JEAL.

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

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

[14]  Reinhard Diestel,et al.  Graph Theory , 1997 .

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

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

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

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

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

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

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

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