Pages that link to "Item:Q1107326"

The following pages link to An optimal time algorithm for finding a maximum weight independent set in a tree (Q1107326):

Displaying 8 items.

• Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
• A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
• A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
• Layered graphs: applications and algorithms (Q2287476) (← links)
• An algorithm for the dominator chromatic number of a tree (Q2352347) (← links)
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
• New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
• Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)