Pages that link to "Item:Q5199279"
From MaRDI portal
The following pages link to PTAS for Densest k-Subgraph in Interval Graphs (Q5199279):
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)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)