Approximation algorithms for finding low-degree subgraphs (Q4651931)

From MaRDI portal
Revision as of 04:52, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2137954
Language Label Description Also known as
English
Approximation algorithms for finding low-degree subgraphs
scientific article; zbMATH DE number 2137954

    Statements

    Approximation algorithms for finding low-degree subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    minimum-degree subgraphs
    0 references
    graph algorithms
    0 references
    network design
    0 references
    graph connectivity
    0 references
    NP-hard problems
    0 references