Pages that link to "Item:Q937406"

The following pages link to A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406):

Displaying 2 items.

• Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
• Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)