Pages that link to "Item:Q5875553"
From MaRDI portal
The following pages link to Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization (Q5875553):
Displaying 9 items.
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← 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)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- (Q5009482) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)