Pages that link to "Item:Q1685998"
From MaRDI portal
The following pages link to Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998):
Displaying 4 items.
- 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)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
