On minimal-node-cost planar embeddings
type: Item
instance of: scholarly article
title: On minimal-node-cost planar embeddings
zbMATH Open document ID: 0546.94033
author: James A. Storer
published in: Networks
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3871205
zbMATH Keywords: minimal-node-cost planar embeddings
zbMATH Keywords: undirected graph
zbMATH Keywords: node cost measure
zbMATH Keywords: VLSI layout
MaRDI profile type: MaRDI publication profile
full work available at URL: net.3230140202
OpenAlex ID: W2114098276
cites work: Q4198056
cites work: Q4198033
cites work: Tape bounds for time-bounded Turing machines
DOI: 10.1002/NET.3230140202
Recommended article: On Embedding a Graph in the Grid with the Minimum Number of Bends
Recommended article: On the Optimal Layout of Planar Graphs with Fixed Boundary
Recommended article: Q4694750
Recommended article: Q3138887
Recommended article: Drawing graphs on rectangular grids
description: scientific article; zbMATH DE number 3871205