The following pages link to (Q4511244):
Displaying 8 items.
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- An optimal time algorithm for finding a maximum weight independent set in a tree (Q1107326) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- (Q5111728) (← links)
- Fully dynamic maximal independent set with sublinear update time (Q5230340) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)