Pages that link to "Item:Q897900"

The following pages link to Algorithms solving the matching cut problem (Q897900):

Displaying 18 items.

• A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
• 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)
• Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← 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)
• The perfect matching cut problem revisited (Q5925551) (← links)
• Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
• Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
• On conflict-free cuts: algorithms and complexity (Q6602320) (← links)
• Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)