Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012)

From MaRDI portal
Revision as of 10:58, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Construction of minimum edge-fault tolerant connected dominating set in a general graph
scientific article

    Statements

    Construction of minimum edge-fault tolerant connected dominating set in a general graph (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2023
    0 references
    edge fault tolerance
    0 references
    connected dominating set
    0 references
    greedy algorithm
    0 references
    approximation ratio
    0 references

    Identifiers