``Global'' graph problems tend to be intractable (Q1820581)

From MaRDI portal
Revision as of 00:55, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
``Global'' graph problems tend to be intractable
scientific article

    Statements

    ``Global'' graph problems tend to be intractable (English)
    0 references
    0 references
    0 references
    1986
    0 references
    measure of globality
    0 references
    information-flow complexity
    0 references
    intractable problems
    0 references
    vertex cover
    0 references
    graph 3-colorability
    0 references
    Hamiltonian circuit
    0 references
    NP-complete problems
    0 references
    edge cover
    0 references
    graph 2-colorability
    0 references
    Eulerian circuit
    0 references
    problems in P
    0 references

    Identifiers