Finding perfect matching cuts faster

DOI10.1007/978-3-031-34347-6_26OpenAlexW4379117585MaRDI QIDQ6182915

Neeldhara Misra, Yash More

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_26

zbMATH Keywords

branch and boundperfect matching cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
• Exact exponential algorithms.
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
• Recognizing decomposable graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• The perfect matching cut problem revisited
• Matching cut in graphs with large minimum degree
• Finding matching cuts in \(H\)-free graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding perfect matching cuts faster