On the number of maximal independent sets in a graph
Authors: David R. Wood 1
0000-0001-8866-3041
David R. Wood
1 Department of Mathematics and Statistics [Melbourne]
Miller and Muller (1960) and independently Moon and Moser (1965) determined the maximum number of maximal independent sets in an n-vertex graph. We give a new and simple proof of this result.
The worst-case time complexity for generating all maximal cliques and computational experiments
2 Documents citing this article
Source : OpenCitations
Bouneb, Zine El Abidine, 2022, A Distributed Algorithm For Computing Groups In IoT Systems, International Journal Of Software Science And Computational Intelligence, 14, 1, pp. 1-21, 10.4018/ijssci.300363.
Phillips, Charles A.; Wang, Kai; Bubier, Jason; Baker, Erich J.; Chesler, Elissa J.; Langston, Michael A., 2015, Scalable Multipartite Subgraph Enumeration For Integrative Analysis Of Heterogeneous Experimental Functional Genomics Data, Proceedings Of The 6Th ACM Conference On Bioinformatics, Computational Biology And Health Informatics, 10.1145/2808719.2812595.