Finding connected \(k\)-subgraphs with high density (Q2407097): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding Dense Subgraphs with Size Bounds / 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: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Densest k-Subgraph Approximation on Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between average case complexity and approximation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved rounding method and semidefinite programming relaxation for graph partition / 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: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Dense Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest \(k\)-subgraph problem on clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for Densest k-Subgraph in Interval Graphs / 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: Graph expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400856 / rank
 
Normal rank

Revision as of 12:13, 14 July 2024

scientific article
Language Label Description Also known as
English
Finding connected \(k\)-subgraphs with high density
scientific article

    Statements

    Finding connected \(k\)-subgraphs with high density (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2017
    0 references
    densest \(k\)-subgraphs
    0 references
    heaviest \(k\)-subgraphs
    0 references
    connectivity
    0 references
    approximation algorithms
    0 references
    interval graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references