Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets
DOI:
https://doi.org/10.7146/brics.v9i45.21760Resumé
In this paper we improve an algorithm by Eppstein (2001) for finding the chromatic number of a graph. We modify the algorithm slightly, and by using a bound on the number of maximal independent sets of size k from our recent paper (2003), we prove that the running time is O(2.4023^n). Eppstein's algorithm runs in time O(2.4150^n). The space usage for both algorithms is O(2^n).Downloads
Publiceret
2002-12-05
Citation/Eksport
Byskov, J. M. (2002). Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets. BRICS Report Series, 9(45). https://doi.org/10.7146/brics.v9i45.21760
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).