doi:[removed]j.tcs[removed]

First Page		Document Content
Date: 2011-11-19 02:39:01 Graph operations Clique Bron–Kerbosch algorithm Maximal independent set Independent set Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems		doi:[removed]j.tcs[removed] Add to Reading List Source URL: snap.stanford.edu Download Document from Source Website File Size: 299,64 KB Share Document on Facebook

	Lecture 5 Maximal Independent Set 5.1 The Problem DocID: 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 Wattenhofer DocID: 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 Laboratory DocID: 1rcqn - View Document