The following pages link to (Q5009482):
Displaying 7 items.
- Algorithms solving the matching cut problem (Q897900) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- 13th International Symposium on Parameterized and Exact Computation (IPEC 2018) (Q4626435) (← links)
- Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization (Q5875553) (← links)
