Pages that link to "Item:Q6058231"
From MaRDI portal
The following pages link to Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> <sub>6</sub> -free Graphs (Q6058231):
Displaying 10 items.
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← 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)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)
