Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (Q4909544)

From MaRDI portal
Revision as of 10:01, 11 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6147812
Language Label Description Also known as
English
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
scientific article; zbMATH DE number 6147812

    Statements

    Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2013
    0 references
    efficient domination
    0 references
    efficient dominating set
    0 references
    efficient edge domination
    0 references
    efficient edge dominating set
    0 references
    graphs
    0 references
    hypergraphs
    0 references
    polynomial time algorithms
    0 references

    Identifiers

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