A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time 论文

2000Journal of Combinatorial Theory Series B引用 681
DOIPDF
Complexity and Algorithms in GraphsCryptography and Data SecurityAdvanced Graph Theory Research
Cryptography and Data SecurityAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs
相关技术:Complexity and Algorithms in Graphs
关系图谱

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time · 作者

A

Alexander Schrijver