A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622)

From MaRDI portal
Revision as of 10:34, 20 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
scientific article

    Statements

    A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (English)
    0 references
    0 references
    0 references
    1994
    0 references
    parsing tree
    0 references
    weighted perfect domination problem
    0 references
    series-parallel graphs
    0 references
    NP-complete
    0 references
    linear time algorithm
    0 references

    Identifiers