<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Spanning tree / Combinatorial optimization / Maximal independent set / Matching / Connectivity / Vertex cover / Minimum spanning tree / Leader election
Date: 2015-05-18 12:16:02
Graph theory
Mathematics
Computational complexity theory
NP-complete problems
Spanning tree
Combinatorial optimization
Maximal independent set
Matching
Connectivity
Vertex cover
Minimum spanning tree
Leader election

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Download Document from Source Website

File Size: 317,21 KB

Share Document on Facebook

Similar Documents

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

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

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document