The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
scientific article

    Statements

    The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2021
    0 references
    \(k\)-path coloring
    0 references
    dynamic programming
    0 references
    bounded tree-width
    0 references
    integrated circuit manufacturing
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references