Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453)

From MaRDI portal
Revision as of 19:07, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
scientific article

    Statements

    Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2018
    0 references
    fault-tolerant
    0 references
    connectivity
    0 references
    DC programming
    0 references
    convex function
    0 references

    Identifiers