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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979368390 / rank
 
Normal rank

Revision as of 01:23, 20 March 2024

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
    0 references
    0 references
    0 references
    0 references
    OR in forestry
    0 references
    dense subgraph
    0 references
    approximation algorithms
    0 references
    0 references
    0 references