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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Vassilios Zissimopoulos / rank
Normal rank
 
Property / author
 
Property / author: Vassilios Zissimopoulos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021294212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic approximation algorithm for the densest \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-edge subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum dispersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Optimization of Monotonic Functions on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic 0-1 knapsack problem with series-parallel support / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:33, 2 July 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
    0 references