Pages that link to "Item:Q3075452"
From MaRDI portal
The following pages link to Densest k-Subgraph Approximation on Intersection Graphs (Q3075452):
Displaying 8 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Strengthening ties towards a highly-connected world (Q832669) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
