The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
scientific article

    Statements

    The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    0 references
    graph algorithms
    0 references
    fixed-parameter tractability
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references