The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The P versus NP-complete dichotomy of some challenging problems in graph theory
scientific article

    Statements

    The P versus NP-complete dichotomy of some challenging problems in graph theory (English)
    0 references
    22 November 2012
    0 references
    analysis of algorithms
    0 references
    problem complexity
    0 references
    graph algorithms
    0 references
    structural characterization of types of graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references