Low-Diameter Graph Decomposition is in NC

Download PDF
Open Webpage

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Published: 1992, Last Modified: 03 Sept 2025SWAT 1992EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We obtain the first deterministic NC algorithm for the lowdiameter graph decomposition problem on arbitrary graphs. We achieve this through derandomizing an algorithm of Linial and Saks. Our algorithm runs in O(log5(n)) time and uses O(n2) processors.