Small Maximal Independent Sets and Faster Exact Graph Coloring (2003) [25 citations — 1 self]
Download:
http://www.cs.brown.edu/publications/jgaa/accepted
http://www.ics.uci.edu/~eppstein/pubs/Epp-WADS-01.
DBLP
CACHED:
http://www.cs.brown.edu/publications/jgaa/accepted
http://www.ics.uci.edu/~eppstein/pubs/Epp-WADS-01.
DBLP
CACHED:
by
David Eppstein
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Eppstein03smallmaximal,
author = {David Eppstein},
title = {Small Maximal Independent Sets and Faster Exact Graph Coloring},
year = {2003}
}
author = {David Eppstein},
title = {Small Maximal Independent Sets and Faster Exact Graph Coloring},
year = {2003}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We show that, for any n-vertex graph G and integer parameter k,there |I|#k,and that all such sets can be listed in time ). These bounds are tight when n/4 n/3. As a consequence, we show how to compute the exact chromatic number of a graph in time O((4/3+3 /4) 2.4150 , improving a previous algorithm of Lawler (1976).
Citations
| 54 | On cliques in graphs – Moon, Moser - 1965 |
| 37 | A note on the complexity of the chromatic number problem – Lawler - 1976 |
| 33 | 3-coloring in time O(1:3446 n ): a no-MIS algorithm – Beigel, Eppstein - 1995 |
| 30 | Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction – Eppstein - 2001 |
| 21 | 3-coloring in time O(1.3289 – Beigel, Eppstein |
| 6 | Deciding 3-Colourability in less than O(1:415 n ) Steps – Schiermeyer - 1994 |
| 4 | On the number of maximal independent sets in a graph – Nielsen - 2002 |
| 1 | On stables in graphs – Croitoru - 1979 |
