Max Weight Independent Set in graphs with no long claws nor large induced bicliques
cs.DS
Submitted: 2026-10-30
Updated: 2026-10-30
Terminology
Sources
- Max Weight Independent Set in sparse graphs with no long claws
- Tree-alpha and excluding finitely many graphs
- Maximum Weight Stable Set in ($P_7$, bull)-free graphs and ($S_{1,2,3}$, bull)-free graphs
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time