Pages that link to "Item:Q2969972"
From MaRDI portal
The following pages link to Dual parameterization and parameterized approximability of subset graph problems (Q2969972):
Displaying 5 items.
- Dual parameterization of weighted coloring (Q786042) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- Parameterized and approximation complexity of the detection pair problem in graphs (Q5371038) (← links)
