<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-09-26 08:28:55Graph theory Graph coloring Defective coloring Maximal independent set Independent set Interval edge coloring MaxCliqueDyn maximum clique algorithm |
Add to Reading List |
Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science, | Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,DocID: 1rrEj - View Document |
 | Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗DocID: 1rd8U - View Document |
 | Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,DocID: 1r2FO - View Document |
 | 3-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗DocID: 1qClZ - View Document |
 | Planar 4-critical graphs with four triangles Oleg V. Borodin ∗ Zdenˇek Dvoˇra´k † Alexandr V. Kostochka Bernard Lidick´ y§DocID: 1qaQe - View Document |