Unit-length embedding of binary trees on a square grid
type: Item
instance of: scholarly article
title: Unit-length embedding of binary trees on a square grid
zbMATH Open document ID: 0672.68014
DOI: 10.1016/0020-0190(89)90118-X
author: Angelo Gregori
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4100603
zbMATH Keywords: graph embedding
zbMATH Keywords: VLSI layout
zbMATH Keywords: wire length
zbMATH Keywords: NP-completeness
zbMATH Keywords: binary tree
MaRDI profile type: Publication
cites work: The complexity of minimizing wire lengths in VLSI layouts
full work available at URL: 0020-0190(89)90118-x
OpenAlex ID: W1967603300
description: scientific article; zbMATH DE number 4100603