Document Open Access Logo

Graph coloring, communication complexity and the stubborn problem (Invited Talk)

Authors Nicolas Bousquet, Aurélie Lagoutte, Thomassé Stéphan



PDF
Thumbnail PDF

File

LIPIcs.STACS.2013.3.pdf
  • Filesize: 389 kB
  • 2 pages

Document Identifiers

Author Details

Nicolas Bousquet
Aurélie Lagoutte
Thomassé Stéphan

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail