<--- Back to Details
First PageDocument Content
NP-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
Date: 2014-09-26 08:28:46
NP-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

Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Add to Reading List

Source URL: dcg.ethz.ch

Download Document from Source Website

File Size: 321,58 KB

Share Document on Facebook

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document