86 search results - page 18 / 18 » On the Maximum Degree of a Random Planar Graph |
PODC
2010
ACM
13 years 9 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...