Distributed minimum spanning tree - PDFSEARCH.IO - Document Search Engine

Distributed minimum spanning tree
Results: 18

#	Item
1	Lecture 6 Minimum Spanning Trees In this lecture, we study another classic graph problem from the distributed point of view: minimum spanning tree construction. Definition 6.1 (Minimum Spanning Tree (MST)). Given a simp Add to Reading List Source URL: www.mpi-inf.mpg.de Language: English - Date: 2016-01-26 08:47:54
2	CPSC 455b Written Homework Assignment # 1 Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2011-08-29 17:33:56 Spanning tree Mathematics Distributed computing Minimum spanning tree Routing Algorithm
3	Lower Bounds for  Local Algorithms Jukka Suomela Aalto University, Finland ! Add to Reading List Source URL: users.ics.aalto.fi Language: English - Date: 2014-10-12 20:39:47 Graph theory Graph Distributed computing Distributed minimum spanning tree
4	CPSC 455b Written Homework Assignment # 1 Due in class Feb. 12, 2002 These exercises are drawn from the following papers (all obtainable from http://pantheon.yale.edu/~sz38/) and from the related lectures and Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2011-08-29 17:33:56 Spanning tree Distributed computing Minimum spanning tree Routing Algorithm
5	Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:16 Graph theory Mathematics Computational complexity theory Spanning tree NP-complete problems Dominating set Minimum spanning tree Maximal independent set Matching Travelling salesman problem Shortest path problem Tree
6	Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:35 Graph theory Mathematics Edsger W. Dijkstra Spanning tree Combinatorial optimization Network theory Shortest path problem Connectivity Distributed computing Minimum spanning tree Clique Matching
7	Towards a Complexity Theory for Local Distributed Computing⇤ Pierre Fraigniaud† Amos Korman† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:35:48 NP-complete problems Graph coloring Graph theory Analysis of algorithms Complexity classes Randomized algorithm Distributed computing Minimum spanning tree SL Theoretical computer science Computational complexity theory Mathematics
8	A Robust Architecture for Distributed Inference in Sensor Networks Mark Paskin Carlos Guestrin and Jim McFadden Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2009-08-13 03:47:06 Graphical models Spanning tree Bayesian statistics Statistical models Belief propagation Coding theory Tree decomposition Minimum spanning tree Routing Graph theory Mathematics Theoretical computer science
9	What Can Be Decided Locally Without Identifiers? Pierre Fraigniaud Mika Göös CNRS and University Paris Diderot Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:36:19 Graph coloring Distributed computing Minimum spanning tree Topology Connectivity Binary tree Randomized algorithm Circuit rank Theoretical computer science Graph theory Mathematics
10	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics Distributed computing Top tree Minimum spanning tree Spanning tree Graph theory Theoretical computer science