Finding paths in graphs avoiding forbidden transitions (Q1861577)

From MaRDI portal
Revision as of 10:57, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding paths in graphs avoiding forbidden transitions
scientific article

    Statements

    Finding paths in graphs avoiding forbidden transitions (English)
    0 references
    0 references
    9 March 2003
    0 references
    compatible path
    0 references
    transition
    0 references
    edge-colored graph
    0 references
    forbidden pairs
    0 references
    NP-completeness
    0 references
    linear time algorithm
    0 references
    transition graph
    0 references
    transition systems
    0 references

    Identifiers