106 citations · 352 across the 51 of their papers we have counts for
Showing 2009 · cs.CGShow all
2 papers · 2 filters
cs.CG2009★ 12 cited
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
Dan Chen, Luc Devroye, Vida Dujmovic +1
A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coor…
cs.CG2009
On the Expected Maximum Degree of Gabriel and Yao Graphs
Luc Devroye, Joachim Gudmundsson, Pat Morin
Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximal degree of a random Gabriel graph or Yao graph defined on points…