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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W4311374588 / rank
 
Normal rank

Revision as of 23:41, 19 March 2024

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
    graph algorithms
    0 references
    fixed-parameter tractability
    0 references
    parameterized complexity
    0 references

    Identifiers