First Page | Document Content | |
---|---|---|
![]() Date: 2006-04-11 06:21:40NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory | Add to Reading List |
![]() | 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 |