Pages that link to "Item:Q450563"
From MaRDI portal
The following pages link to Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563):
Displaying 4 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
