Routing with critical paths
type: Item
instance of: scholarly article
title: Routing with critical paths
zbMATH Open document ID: 0695.68045
DOI: 10.1016/0020-0190(90)90223-K
author: Shai Simonson
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 4139299
zbMATH Keywords: routing
zbMATH Keywords: embedding
zbMATH Keywords: VLSI
zbMATH Keywords: layout
zbMATH Keywords: graph
MaRDI profile type: Publication
cites work: On optimal linear arrangements of trees
cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
cites work: Complexity Results for Bandwidth Minimization
cites work: Some simplified NP-complete graph problems
cites work: Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
cites work: Flit-serial packet routing on meshes and tori
cites work: One-dimensional logic gate assignment and interval graphs
cites work: A variation on the min cut linear arrangement problem
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
description: scientific article; zbMATH DE number 4139299