![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 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](https://www.pdfsearch.io/img/0ae90594ae492e71322cfd4e2b39e41e.jpg) Date: 2015-05-18 12:16:02Graph 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 ListSource URL: www.tik.ee.ethz.chDownload Document from Source Website File Size: 317,21 KBShare Document on Facebook
|