Pages that link to "Item:Q2467485"
From MaRDI portal
The following pages link to An exact algorithm for MAX-CUT in sparse graphs (Q2467485):
Displaying 6 items.
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
