Pages that link to "Item:Q5901434"
From MaRDI portal
The following pages link to A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434):
Displaying 8 items.
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> <sub>6</sub> -free Graphs (Q6058231) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)