Skip to main navigation Skip to search Skip to main content

Low‐diameter graph decomposition is in NC

  • Baruch Awerbuch
  • , Bonnie Berger
  • , Lenore Cowen
  • , David Peleg
  • Massachusetts Institute of Technology
  • Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

We obtain the first 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. © 1994 John Wiley & Sons, Inc.

Original languageEnglish
Pages (from-to)441-452
Number of pages12
JournalRandom Structures and Algorithms
Volume5
Issue number3
DOIs
StatePublished - Jul 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'Low‐diameter graph decomposition is in NC'. Together they form a unique fingerprint.

Cite this