Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-021-00798-8
Abstract: A matching cut is a partition of the vertex set of a graph into two sets A and B such that each vertex has at most one neighbor in the other side of the cut.… read more here.
Keywords: bounded degree; degree complexity; cuts bounded; matching cut ... See more keywords