Pages that link to "Item:Q461929"
From MaRDI portal
The following pages link to Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929):
Displaying 5 items.
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- The exact weighted independent set problem in perfect graphs and related classes (Q2840556) (← links)
- Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs (Q2946027) (← links)