Sciweavers

SWAT
1992
Springer
104views Algorithms» more  SWAT 1992»
13 years 8 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...