Algorithms on Graphs with Small Dominating Targets (Q5459110)

From MaRDI portal
Revision as of 22:41, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5267581
Language Label Description Also known as
English
Algorithms on Graphs with Small Dominating Targets
scientific article; zbMATH DE number 5267581

    Statements

    Algorithms on Graphs with Small Dominating Targets (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2008
    0 references
    dominating target
    0 references
    \(d\)-octopus
    0 references
    dominating set
    0 references
    dominating-pair graph
    0 references
    Steiner tree.
    0 references

    Identifiers

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