Enumerating minimal dominating sets in chordal bipartite graphs (Q896653)

From MaRDI portal
Revision as of 13:56, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q344850)
scientific article
Language Label Description Also known as
English
Enumerating minimal dominating sets in chordal bipartite graphs
scientific article

    Statements

    title
    Enumerating minimal dominating sets in chordal bipartite graphs (English)
    0 references
    author
    Petr A. Golovach
    0 references
    Pinar Heggernes
    0 references
    Dieter Kratsch
    0 references
    Yngve Villanger
    0 references
    publication date
    10 December 2015
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    05C30
    0 references
    05C35
    0 references
    05C85
    0 references
    zbMATH DE Number
    6519402
    0 references
    zbMATH Keywords
    minimal dominating set
    0 references
    enumeration
    0 references
    output polynomial algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q896653&oldid=21006809"
    Powered by MediaWiki