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.

• Type: Conference
• Year: 1992
• Where: SWAT
• Authors: Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
• Keywords: Algorithms, Graph Decomposition Problem, Rst Nc Algorithm, SWAT 1992