Sciweavers

86 search results - page 18 / 18
» On the Maximum Degree of a Random Planar Graph
Sort
View
PODC
2010
ACM
14 years 2 months ago
Deterministic distributed vertex coloring in polylogarithmic time
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...
Leonid Barenboim, Michael Elkin