Pages that link to "Item:Q378171"
From MaRDI portal
The following pages link to Efficient computation of tolerances in the weighted independent set problem for trees (Q378171):
Displaying 4 items.
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- An optimal time algorithm for finding a maximum weight independent set in a tree (Q1107326) (← 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)