Pages that link to "Item:Q2361357"

The following pages link to Linear kernels for separating a graph into components of bounded size (Q2361357):

Displaying 3 items.

• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)