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 language | English |
|---|---|
| Pages (from-to) | 441-452 |
| Number of pages | 12 |
| Journal | Random Structures and Algorithms |
| Volume | 5 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jul 1994 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Low‐diameter graph decomposition is in NC'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver