Sciweavers

Share
SWAT
1992
Springer

Low-Diameter Graph Decomposition is in NC

9 years 6 months ago
Low-Diameter Graph Decomposition is in NC
We obtain the rst NC algorithm for the low-diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5 (n)) time, and uses O(n2) processors.
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1992
Where SWAT
Authors Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
Comments (0)
books