Pages that link to "Item:Q2444144"

The following pages link to Improvements to MCS algorithm for the maximum clique problem (Q2444144):

Displaying 13 items.

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
• Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
• A clique search problem and its application to machine scheduling (Q2068853) (← links)
• Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
• Finding near-optimal independent sets at scale (Q2401330) (← links)
• On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)