Pages that link to "Item:Q2192064"
From MaRDI portal
The following pages link to Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064):
Displayed 12 items.
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- The perfect matching cut problem revisited (Q5925551) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)