The complexity of finding uniform emulations on paths and ring networks (Q918210)

From MaRDI portal
Revision as of 19:05, 17 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59568073, #quickstatements; #temporary_batch_1705514146057)
scientific article
Language Label Description Also known as
English
The complexity of finding uniform emulations on paths and ring networks
scientific article

    Statements

    The complexity of finding uniform emulations on paths and ring networks (English)
    0 references
    0 references
    1990
    0 references
    termed emulation
    0 references
    connected graph
    0 references
    NP-complete
    0 references

    Identifiers