Distributed (∆ 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science, - Province of Málaga - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-09-26 08:28:55 Graph theory Graph coloring Defective coloring Maximal independent set Independent set Interval edge coloring MaxCliqueDyn maximum clique algorithm		Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science, Add to Reading List Source URL: www.dcg.ethz.ch Download Document from Source Website File Size: 538,65 KB Share Document on Facebook