Complexity of Single-Layer Routing (Q3309079)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of Single-Layer Routing
scientific article

    Statements

    title
    Complexity of Single-Layer Routing (English)
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    NP-completeness
    0 references
    planar graphs
    0 references
    single-layer routing
    0 references
    vertex disjoint paths
    0 references
    VLSI design
    0 references
    author
    D. S. Richards
    0 references

    Identifiers

    zbMATH DE Number
    3839336
    0 references
    OpenAlex ID
    W2082791002
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3309079&oldid=37300050"
    Powered by MediaWiki