A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

26 Oct 2018 Le Hoang-Oanh Le Van Bang

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY
  • DISCRETE MATHEMATICS
  • DATA STRUCTURES AND ALGORITHMS