Pages that link to "Item:Q434194"
From MaRDI portal
The following pages link to The \textsc{max quasi-independent set} problem (Q434194):
Displaying 4 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Largest sparse subgraphs of random graphs (Q2509750) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
