Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes (Q5757876)

From MaRDI portal
Revision as of 21:37, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5188769
Language Label Description Also known as
English
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
scientific article; zbMATH DE number 5188769

    Statements

    Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references