<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-09-26 08:28:46NP-complete problems Graph coloring Edge coloring Independent set Dominating set Combinatorial optimization Search algorithms Maximal independent set Minimum spanning tree Graph theory Theoretical computer science Mathematics |
Add to Reading List |
Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher | Distributed Computing Prof. R. Wattenhofer BA/MA/SA: Geometric Edge-ColoringDocID: 1xVcm - View Document |
| Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi de nitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring in nite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings.DocID: 1upWX - View Document |
| Strong Edge Coloring Marleen Kock December 11, 2012 1DocID: 1sisf - View Document |
| Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,DocID: 1rrEj - View Document |
| Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. ThilikosDocID: 1rq3s - View Document |