Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2013.3
URN: urn:nbn:de:0030-drops-39158
URL: https://drops.dagstuhl.de/opus/volltexte/2013/3915/
Bousquet, Nicolas ; Lagoutte, Aurélie ; Stéphan, Thomassé
Graph coloring, communication complexity and the stubborn problem (Invited talk)
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{bousquet_et_al:LIPIcs:2013:3915,
author = {Nicolas Bousquet and Aur{\'e}lie Lagoutte and Thomass{\'e} St{\'e}phan},
title = {{Graph coloring, communication complexity and the stubborn problem (Invited talk)}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {3--4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Natacha Portier and Thomas Wilke},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3915},
URN = {urn:nbn:de:0030-drops-39158},
doi = {10.4230/LIPIcs.STACS.2013.3},
annote = {Keywords: stubborn problem, graph coloring, Clique-Stable set separation, Alon-Saks-Seymour conjecture, bipartite packing}
}
| Keywords: | stubborn problem, graph coloring, Clique-Stable set separation, Alon-Saks-Seymour conjecture, bipartite packing | |
| Seminar: | 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) | |
| Issue date: | 2013 | |
| Date of publication: | 26.02.2013 |
