Approximation algorithms for finding low-degree subgraphs (Q4651931): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 17:28, 7 February 2024

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