Pages that link to "Item:Q3447472"

The following pages link to Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472):

Displaying 6 items.

• Worst-case analysis of clique MIPs (Q2089781) (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← links)
• Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)