• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths.

Hoàng-Oanh LeVan Bang Le
Published in: WG (2023)
Keyphrases
  • decision problems
  • graph matching
  • tractable cases
  • neural network
  • optimization problems
  • np complete
  • matching algorithm
  • pairwise
  • application domains
  • space complexity
  • solving problems
  • polynomial hierarchy