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

From MaRDI portal
Revision as of 22:29, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    1983
    0 references
    weighted undirected graph
    0 references
    NP-hard
    0 references
    recursive backtracking algorithm
    0 references
    0 references
    0 references

    Identifiers