An FPT algorithm for matching cut and d-cut
From MaRDI portal
Publication:2115892
Cites work
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- A simple min-cut algorithm
- Algorithms solving the matching cut problem
- Designing FPT algorithms for cut problems using randomized contractions
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Fundamentals of parameterized complexity
- Matching cut in graphs with large minimum degree
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- On structural parameterizations of the matching cut problem
- On the complexity of matching cut in graphs of fixed diameter
- Parameterized algorithms
- Randomized Contractions Meet Lean Decompositions
- Recognizing decomposable graphs
- The complexity of the matching-cut problem for planar graphs and other graph classes
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth reduction for constrained separation and bipartization problems
Cited in
(6)- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Finding matching cuts in \(H\)-free graphs
- The perfect matching cut problem revisited
- The perfect matching cut problem revisited
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
This page was built for publication: An FPT algorithm for matching cut and d-cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115892)
