Pages that link to "Item:Q896662"

The following pages link to An exact algorithm for maximum independent set in degree-5 graphs (Q896662):

Displaying 10 items.

• A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
• A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
• Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• Exact algorithms for maximum independent set (Q2013558) (← links)
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
• Exact algorithms for maximum induced matching (Q2407101) (← links)
• (Q4871035) (← links)
• An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs (Q5405918) (← links)
• Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)