Pages that link to "Item:Q685307"

The following pages link to Combinatorial properties and the complexity of a max-cut approximation (Q685307):

Displaying 3 items.

• Computing the Grothendieck constant of some graph classes (Q408441) (← links)
• Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)