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):
Displaying 6 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)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
