scientific article; zbMATH DE number 3864518
From MaRDI portal
Publication:3332263
zbMATH Open0543.68053MaRDI QIDQ3332263FDOQ3332263
Authors: Mark H. Overmars 
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
- On the maximum edge length in VLSI layouts of complete binary trees
- An optimal emulator and VLSI layout for complete binary trees
- scientific article; zbMATH DE number 3910313
- Efficient Embeddings of Binary Trees in VLSI Arrays
- Treewidth computations. II. Lower bounds
- Embedding ternary trees in VLSI arrays
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- scientific article; zbMATH DE number 437543
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees
- A lower bound for treewidth and its consequences
Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Cited In (6)
- A log log n data structure for three-sided range queries
- Expansion of layouts of complete binary trees into grids
- Minced trees, with applications to fault-tolerant VLSI processor arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximum edge length in VLSI layouts of complete binary trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332263)
