<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-03-10 09:37:00Graph coloring NP-complete problems Degeneracy Matching SL Triangle-free graph Maximal independent set Independent set Arboricity Graph theory Theoretical computer science Mathematics |
| Lecture 5 Maximal Independent Set 5.1 The ProblemDocID: 1v2MD - View Document |
| Noname manuscript No. (will be inserted by the editor) An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs Johannes Schneider · Roger WattenhoferDocID: 1rvrw - View Document |
| Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,DocID: 1rrEj - View Document |
| arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗DocID: 1rlA9 - View Document |
| Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks LaboratoryDocID: 1rcqn - View Document |