An algorithm for the maximum internally stable set in a weighted graph (Q3968462)

From MaRDI portal
Revision as of 06:01, 21 October 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
An algorithm for the maximum internally stable set in a weighted graph
scientific article

    Statements

    An algorithm for the maximum internally stable set in a weighted graph (English)
    0 references
    0 references
    0 references
    1983
    0 references
    weighted undirected graph
    0 references
    NP-hard
    0 references
    recursive backtracking algorithm
    0 references

    Identifiers