Pages that link to "Item:Q2695332"

The following pages link to Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332):

Displaying 9 items.

• An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
• A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
• Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
• Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← 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)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
• Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method (Q3376664) (← links)
• (Q5417623) (← links)