scientific article; zbMATH DE number 4185548

zbMath0718.94016MaRDI QIDQ5750822

Paul Molitor

Publication date: 1991

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity of wirabilityminimal stretching algorithmswiring (layer assignment)

Mathematics Subject Classification ID

Related Items (10)

The pin redistribution problem in multi-chip modules ⋮ Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid ⋮ Vertex intersection graphs of paths on a grid: characterization within block graphs ⋮ Performance driven k-layer wiring ⋮ On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid ⋮ Unnamed Item ⋮ Edge intersection graphs of systems of paths on a grid with a bounded number of bends ⋮ Edge intersection graphs of single bend paths on a grid ⋮ Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid ⋮ String graphs of k-bend paths on a grid

This page was built for publication: