Skip to main content
Conference Proceedings

Low-diameter graph decomposition is in NC

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 621 LNCS 83-93
DOI: 10.1007/3-540-55706-7_8
10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Awerbuch, B., Berger, B., Cowen, L., & Peleg, D. (1992). Low-diameter graph decomposition is in NC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 621 LNCS, pp. 83–93). Springer Verlag. https://doi.org/10.1007/3-540-55706-7_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free