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 | Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,Add to Reading ListSource URL: www.dcg.ethz.chDownload Document from Source WebsiteFile Size: 538,65 KBShare Document on Facebook |
Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. CookDocID: 1xVkB - View Document | |
PDF DocumentDocID: 1xkJU - View Document | |
Graph theory Po-Shen Loh JuneDocID: 1vmTo - View Document | |
Graph theory Po-Shen Loh JuneDocID: 1vhpu - View Document | |
Graph theory Po-Shen Loh JuneDocID: 1v8nl - View Document |