Pages that link to "Item:Q765501"
From MaRDI portal
The following pages link to Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501):
Displaying 6 items.
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- PTAS for Densest k-Subgraph in Interval Graphs (Q5199279) (← links)