Pages that link to "Item:Q1725633"
From MaRDI portal
The following pages link to Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633):
Displaying 15 items.
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- (Q5075768) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894) (← links)
- (Q5874504) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)
