The weighted independent domination problem is NP-complete for chordal graphs (Q1887072)

From MaRDI portal
Revision as of 16:21, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The weighted independent domination problem is NP-complete for chordal graphs
scientific article

    Statements

    title
    The weighted independent domination problem is NP-complete for chordal graphs (English)
    0 references
    publication date
    23 November 2004
    0 references
    zbMATH DE Number
    2118355
    0 references
    zbMATH Keywords
    Chordal graph
    0 references
    Independent domination
    0 references
    NP-complete
    0 references
    Weight
    0 references
    OpenAlex ID
    W2015322736
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1887072&oldid=34375184"
    Powered by MediaWiki