Journal of Graph Algorithms and Applications
http://jgaa.info ISSN: 1526-1719
|
DOI: 10.7155/jgaa.00064 Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Vol. 7, no. 2, pp. 131-140, 2003. Regular paper Abstract We show that, for any n-vertex graph G and integer parameter k, there are at most 34k−n 4n−3k maximal independent sets I ⊂ G with |I| ≤ k, and that all such sets can be listed in time O(34k−n 4n−3k). These bounds are tight when n/4 ≤ k ≤ n/3. As a consequence, we show how to compute the exact chromatic number of a graph in time O((4/3 + 34/3/4)n) ≈ 2.4150n, improving a previous O((1+31/3)n) ≈ 2.4422n algorithm of Lawler (1976).
|
Revised: April 2002. Submitted: October 2001. Communicated by Giuseppe Liotta and Ioannis Tollis |
| Journal of Graph Algorithms and Applications |