On the Number of Maximal Independent Sets in a Graph

On the Number of Maximal Independent Sets in a Graph (2002)

by Jesper Makholm Nielsen

Citations:

@MISC{Nielsen02onthe,
    author = {Jesper Makholm Nielsen},
    title = {On the Number of Maximal Independent Sets in a Graph},
    year = {2002}
}

83	L: On cliques in graphs - Moon, Moser - 1965
35	Improved algorithms for 3-coloring, 3edge-coloring, and constraint satisfaction,” Symposium on Discrete Algorithms - Eppstein - 2001
31	Small maximal independent sets and faster exact graph coloring - Eppstein
17	Equational axioms for probabilistic bisimilarity (preliminary report - Aceto, Ésik, et al. - 1999
15	Optimal black-box secret sharing over arbitrary abelian groups - Cramer, Fehr - 2002
13	Uniform asymptotic regularity for Mann iterates - Kohlenbach
8	C.N.S.: Solving the string statistics problem in time o(n log n - Brodal, Lyngsø, et al. - 2002
3	Extending Java for High-Level Web Service Construction - Schwartzbach - 2002
3	Östlin and Rasmus Pagh. One-Probe Search - Anna - 2002
3	Composing Strand Spaces. February 2002 - Crazzolara, Winskel
2	On stables in graphs - Croitoru - 1978
2	This report supersedes the earlier report BRICS - March
1	4] Mihály Hujter and Zsolt Tuza. The number of maximal independent sets in triangle-free graphs - Johnson, Yannakakis, et al. - 1993