Pages that link to "Item:Q494789"

The following pages link to A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789):

Displaying 3 items.

• A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
• $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
• Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)