David Eppstein  Home/Search
Context Related
| brown.edu/publicat...pstein2003.7.2.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~eppstein/pubs/all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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). (Update)
Cited by: More
Generating Small Combinatorial Test Suites to Cover.. - Cheng, Dumitrescu.. (2004) (Correct)
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
A Simple and Fast Approach for Solving Problems on Planar Graphs - Fomin, Thilikos (2004) (Correct)
Similar documents (at the sentence level):
53.2%: Small Maximal Independent Sets and Faster Exact Graph Coloring - Eppstein (2001) (Correct)
Active bibliography (related documents): More All
0.5: On the Phase Transitions of Graph Coloring and Independent Sets - Barbosa, Ferreira (2002) (Correct)
0.2: 3-Coloring in time O(1.3446^n): a no-MIS algorithm - Beigel, Eppstein (1995) (Correct)
0.2: Constraint Satisfaction Problems With Critical Variables - Williams (2002) (Correct)
Similar documents based on text: More All
0.2: A Framework for the Static and Interactive Visualization.. - Castelló, Mili, Tollis (2002) (Correct)
0.2: Polar Coordinate Drawing of Planar Graphs with Good Angular.. - Duncan (2003) (Correct)
0.2: Visualization of the High Level Structure of the.. - Carmignani, Di.. (2002) (Correct)
Related documents from co-citation: More All
2: Introduction to Graph Theory (context) - West - 1996
2: A Separator Theorem for Planar Graphs (context) - Lipton, Tarjan - 1979
2: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
D. Eppstein, Small maximal independent sets and faster exact graph coloring, in WADS http://citeseer.ist.psu.edu/eppstein03small.html More
@article{ eppstein00small,
author = "David Eppstein",
title = "Small Maximal Independent Sets and Faster Exact Graph Coloring",
journal = "Lecture Notes in Computer Science",
volume = "2125",
pages = "462--??",
year = "2000",
url = "citeseer.ist.psu.edu/eppstein03small.html" }
Citations (may not include all citations):17 On cliques in graphs (context) - Moon, Moser - 1965
7 A note on the complexity of the chromatic number problem (context) - Lawler - 1976
5 Improved algorithms for 3-coloring (context) - Eppstein - 2001
2 Babes-Bolyai Univ (context) - Croitoru, in et al. - 1979
2 the number of maximal independent sets in a graph (context) - Nielsen - 2002
1 Deciding 3-colourability in less than ) steps (context) - Schiermeyer - 1994
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996) (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999) (Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC