Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764)

From MaRDI portal
Revision as of 01:58, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60242777, #quickstatements; #temporary_batch_1707252663060)
scientific article
Language Label Description Also known as
English
Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
scientific article

    Statements

    Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (English)
    0 references
    0 references
    3 February 2015
    0 references
    OR in forestry
    0 references
    dense subgraph
    0 references
    approximation algorithms
    0 references

    Identifiers