Finding perfect matching cuts faster

DOI10.1007/978-3-031-34347-6_26MaRDI QIDQ6182915zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Exact exponential algorithms.
• Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
• Finding matching cuts in \(H\)-free graphs
• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• scientific article; zbMATH DE number 7378605 (Why is no real title available?)
• Matching cut in graphs with large minimum degree
• Recognizing decomposable graphs
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
• The perfect matching cut problem revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182915)