The following pages link to (Q5874519):
Displaying 4 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)