The complexity of restricted spanning tree problems (Q3936213)

From MaRDI portal
Revision as of 23:42, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of restricted spanning tree problems
scientific article

    Statements

    The complexity of restricted spanning tree problems (English)
    0 references
    1982
    0 references
    traveling salesman problem
    0 references
    network problems
    0 references
    NP-complete
    0 references
    polynomial algorithm
    0 references
    matching
    0 references

    Identifiers

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