Pages that link to "Item:Q2300620"

The following pages link to Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620):

Displaying 7 items.

• \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
• \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable (Q1625174) (← links)
• \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
• Max-Cut Parameterized above the Edwards-Erdős Bound (Q2843252) (← links)
• Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
• A POLYNOMIAL KERNEL FOR MULTICUT IN TREES (Q5389976) (← links)
• Complexity of maximum cut on interval graphs (Q6174803) (← links)