![Graph theory / Mathematics / Theoretical computer science / NP-complete problems / Distributed computing / Symposium on Principles of Distributed Computing / ACM SIGACT / Graph coloring / Algorithm / Independent set / Dijkstra Prize / Symposium on Parallelism in Algorithms and Architectures Graph theory / Mathematics / Theoretical computer science / NP-complete problems / Distributed computing / Symposium on Principles of Distributed Computing / ACM SIGACT / Graph coloring / Algorithm / Independent set / Dijkstra Prize / Symposium on Parallelism in Algorithms and Architectures](https://www.pdfsearch.io/img/b8954dde8c78f884bcbacd47c7327610.jpg) Date: 2014-09-26 08:37:01Graph theory Mathematics Theoretical computer science NP-complete problems Distributed computing Symposium on Principles of Distributed Computing ACM SIGACT Graph coloring Algorithm Independent set Dijkstra Prize Symposium on Parallelism in Algorithms and Architectures | | Prof. Roger Wattenhofer http://www.dcg.ethz.ch Semester/Master Thesis Distributed Graph Coloring Motivation and Informal DescriptionAdd to Reading ListSource URL: disco.ethz.chDownload Document from Source Website File Size: 132,20 KBShare Document on Facebook
|