错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Maximizing Matching Cuts

  • Van Bang Le,
  • Felicia Lucke,
  • Daniël Paulusma,
  • Bernard Ries

摘要

Graph cut problems belong to a well-studied class of classical graph problems related to network connectivity, which is a central concept within theoretical computer science.