108 citations · 130 across the 9 of their papers we have counts for
1 paper · 2 filters
Aubin Jarry, Florian Huc, Pierre Leone +1
We present an algorithm which computes a planar 2-spanner from an Unit Disk Graph when the node density is sufficient. The communication complexity in terms of number of node's ide…