Approximating connectivity domination in weighted bounded-genus graphs (Q5361863)

From MaRDI portal
Revision as of 05:38, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6784103
Language Label Description Also known as
English
Approximating connectivity domination in weighted bounded-genus graphs
scientific article; zbMATH DE number 6784103

    Statements

    Approximating connectivity domination in weighted bounded-genus graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2017
    0 references
    approximation algorithm
    0 references
    bounded genus
    0 references
    connected dominating set
    0 references
    feedback vertex set
    0 references
    graph
    0 references
    planar graph
    0 references
    polynomial-time approximation scheme
    0 references

    Identifiers

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