Pages that link to "Item:Q5146928"
From MaRDI portal
The following pages link to Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs (Q5146928):
Displaying 9 items.
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← 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)
- (Q5874491) (← links)
- (Q5874504) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)