Pages that link to "Item:Q3188867"

The following pages link to Approximating the Sparsest k-Subgraph in Chordal Graphs (Q3188867):

Displaying 3 items.

• Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
• PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
• Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)