The maximum edge biclique problem is NP-complete 论文
2003Discrete Applied Mathematics引用 371
Advanced Graph Theory Researchgraph theory and CDMA systemsLimits and Structures in Graph Theory
The maximum edge biclique problem is NP-complete · 相关文章
暂无数据
暂无数据