Pages that link to "Item:Q4634024"
From MaRDI portal
The following pages link to Minimum Bisection Is Fixed-Parameter Tractable (Q4634024):
Displaying 4 items.
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
