Tutte seminar - Brendan Rooney
Hardness of computing clique number and chromatic number for cayley graphs
Speaker: | Brendan Rooney |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5479 |
Abstract:
Computing the clique number and chromatic number of a general graph are well-known to be NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna.