Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
scientific article

    Statements

    Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 February 2017
    0 references
    0 references
    minimum paths in coloured graphs
    0 references
    NP-hardness
    0 references
    heuristics
    0 references
    WDM networks
    0 references
    0 references