A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (Q3522944)

From MaRDI portal
Revision as of 17:08, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
scientific article

    Statements

    A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (English)
    0 references
    0 references
    0 references
    4 September 2008
    0 references

    Identifiers

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