Complexity of Single-Layer Routing

DOI10.1109/TC.1984.1676428zbMATH Open0528.68047OpenAlexW2082791002MaRDI QIDQ3309079FDOQ3309079

Authors: Dana 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

NP-completenessplanar graphsVLSI designvertex disjoint pathssingle-layer routing

Mathematics Subject Classification ID

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

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309079)