Pages that link to "Item:Q963469"
From MaRDI portal
The following pages link to A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469):
Displayed 11 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)