LIPIcs.STACS.2013.3.pdf
- Filesize: 389 kB
- 2 pages
Document
Graph coloring, communication complexity and the stubborn problem (Invited Talk)
Authors
-
Part of:
Volume:
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2013-02-26
Cite AsGet BibTex
Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan. Graph coloring, communication complexity and the stubborn problem (Invited Talk). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 3-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.STACS.2013.3
https://doi.org/10.4230/LIPIcs.STACS.2013.3
Abstract
We discuss three equivalent forms of the same problem arising in communication complexity, constraint satisfaction problems, and graph coloring. Some partial results are discussed.
Keywords
- stubborn problem
- graph coloring
- Clique-Stable set separation
- Alon-Saks-Seymour conjecture
- bipartite packing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads