A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1029096
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Vassilios Zissimopoulos / rank
 
Normal rank

Revision as of 04:56, 22 February 2024

scientific article
Language Label Description Also known as
English
A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
scientific article

    Statements

    A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (English)
    0 references
    0 references
    0 references
    19 April 2010
    0 references
    0 references
    densest \(k\)-subgraph
    0 references
    chordal graphs
    0 references
    approximation algorithms
    0 references