Maximum bounded 3-dimensional matching is MAX SNP-complete 论文

1991Information Processing Letters引用 277
DOI
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchCooperative Communication and Network Coding
Advanced Graph Theory ResearchComplexity and Algorithms in GraphsCooperative Communication and Network Coding
相关技术:Complexity and Algorithms in GraphsCooperative Communication and Network Coding
关系图谱

1

作者

2

相关技术

0

相关事件

0

相关文章

作者查看全部 (1)

V

Viggo Kann

相关技术查看全部 (2)

Complexity and Algorithms in GraphsCooperative Communication and Network Coding

相关事件

暂无数据

相关文章

暂无数据