Abstract
In “A Compact Layout for the Three-Dimensional Tree of Meshes”by Ronald I. Greenberg and Charles E. Leiserson which appeared in Vol. 1, No. 2, pp. 171-176, the maximum edge length of the layout was stated incorrectly. In the abstract, the last paragraph of Section 1, the first and last paragraphs of Section 2, and Theorem 2, the maximum wire length bound for T_{3,n}^l should read "O(l^(/12))“rather than “O(nl^(1/2))".
| Original language | American English |
|---|---|
| Journal | Computer Science: Faculty Publications and Other Works |
| Volume | 1 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jan 1 1988 |
Keywords
- VLSI graph layout
- tree of meshes graph
- embedding
Disciplines
- Computer Sciences
- Theory and Algorithms
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS