Algorithms for k-colouring and finding maximal independent sets

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 456-457

  Byskov, Jesper Makholm ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE METHODS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

EXPONENTIAL SPACE; K-COLOURING; MAXIMAL INDEPENDENT SETS; POLYNOMIAL SPACE;

ALGORITHMS;

EID: 0038077524     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In Proc. 12th Symp. Discrete Algorithms, pages 329-337. ACM and SIAM, Jan. 2001. URL http://arXiv.org/abs/cs.DS/0009006.
2. D. Eppstein. Small maximal independent sets and faster exact graph coloring. In Proc. 7th Worksh. Algorithms and Data Structures, volume 2125 of Lecture Notes in Computer Science, pages 462-470 2001. Springer-Verlag, Aug. 2001. URL http://arXiv.org/abs/cs.DS/0011009.
3. E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Process. Lett., 5(3):66-67, Aug. 1976.
4. B. A. Madsen, J. M. Nielsen and B. Skjernaa. On the number of maximal bipartite subgraphs of a graph. Research Series RS-02-17, BRICS, Department of Computer Science, University of Aarhus, Apr. 2002. URL http://www.brics.dk/RS/02/17/.
5. J. M. Nielsen. On the number of maximal independent sets in a graph. Research Series RS-02-15, BRICS, Department of Computer Science, University of Aarhus, Apr. 2002, URL http://www.brics.dk/RS/02/15/.