Back to Results
First PageMeta Content
Algorithm / Mathematical logic / Theoretical computer science / Edsger W. Dijkstra / Spanning tree / Graphical models


Exercise 2: Flirting with Synchrony and Asynchrony Task 1: Growing Balls Denote by B(v, r) the ball of radius r around v, i.e., B(v, r) = {u ∈ V : dist(u, v) ≤ r}. Consider the following partitioning algorithm. Algor
Add to Reading List

Document Date: 2014-10-28 15:42:59


Open Document

File Size: 90,70 KB

Share Result on Facebook