Complexity of Single-Layer Routing

DOI10.1109/TC.1984.1676428zbMath0528.68047OpenAlexW2082791002MaRDI QIDQ3309079

D. S. Richards

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.1676428

zbMATH Keywords

VLSI designplanar graphsNP-completenessvertex disjoint pathssingle-layer routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Computing minimum length paths of a given homotopy class ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems

This page was built for publication: Complexity of Single-Layer Routing