Standard
Combinatorial coloring of 3-colorable graphs. / Kawarabayashi, Ken-ichi; Thorup, Mikkel.
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE, 2012. p. 68-75.
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Kawarabayashi, K
& Thorup, M 2012,
Combinatorial coloring of 3-colorable graphs. in
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE, pp. 68-75, IEEE 53rd Annual Symposium on Foundations of Computer Science, New Brunswick, New Jersey, United States,
20/10/2012.
https://doi.org/10.1109/FOCS.2012.16APA
Kawarabayashi, K.
, & Thorup, M. (2012).
Combinatorial coloring of 3-colorable graphs. In
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (pp. 68-75). IEEE.
https://doi.org/10.1109/FOCS.2012.16Vancouver
Kawarabayashi K
, Thorup M.
Combinatorial coloring of 3-colorable graphs. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE. 2012. p. 68-75
https://doi.org/10.1109/FOCS.2012.16Author
Kawarabayashi, Ken-ichi ; Thorup, Mikkel. / Combinatorial coloring of 3-colorable graphs. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE, 2012. pp. 68-75
Bibtex
@inproceedings{4ca73b18f9bc4284a9dd6ef10170b5fa,
title = "Combinatorial coloring of 3-colorable graphs",
keywords = "computational complexity, graph colouring, mathematical programming, 3-colorable graph, {\~O}(n0.2072) colors, {\~O}(n0. 2049) colors, {\~O}(n4/11) colors, combinatorial coloring algorithm, polynomial time, semi-definite programming approaches, Algorithm design and analysis, Approximation algorithms, Approximation methods, Color, Computer science, Electronic mail, Polynomials, Approximation Algorithms, Graph Coloring",
author = "Ken-ichi Kawarabayashi and Mikkel Thorup",
year = "2012",
doi = "10.1109/FOCS.2012.16",
language = "English",
isbn = "978-1-4673-4383-1",
pages = "68--75",
booktitle = "2012 IEEE 53rd Annual Symposium on Foundations of Computer Science",
publisher = "IEEE",
note = "null ; Conference date: 20-10-2012 Through 23-10-2012",
}
RIS
TY - GEN
T1 - Combinatorial coloring of 3-colorable graphs
AU - Kawarabayashi, Ken-ichi
AU - Thorup, Mikkel
N1 - Conference code: 53
PY - 2012
Y1 - 2012
KW - computational complexity
KW - graph colouring
KW - mathematical programming
KW - 3-colorable graph
KW - Õ(n0.2072) colors
KW - Õ(n0. 2049) colors
KW - Õ(n4/11) colors
KW - combinatorial coloring algorithm
KW - polynomial time
KW - semi-definite programming approaches
KW - Algorithm design and analysis
KW - Approximation algorithms
KW - Approximation methods
KW - Color
KW - Computer science
KW - Electronic mail
KW - Polynomials
KW - Approximation Algorithms
KW - Graph Coloring
U2 - 10.1109/FOCS.2012.16
DO - 10.1109/FOCS.2012.16
M3 - Article in proceedings
SN - 978-1-4673-4383-1
SP - 68
EP - 75
BT - 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
PB - IEEE
Y2 - 20 October 2012 through 23 October 2012
ER -
