Approximating <i>s-t</i> minimum cuts in <i>Õ</i>(<i>n</i><sup>2</sup>) time 论文

1996引用 272
DOI
Complexity and Algorithms in GraphsAlgorithms and Data Compressionsemigroups and automata theory
Algorithms and Data Compressionsemigroups and automata theoryComplexity and Algorithms in Graphs
相关技术:Algorithms and Data CompressionComplexity and Algorithms in Graphs
关系图谱

Approximating <i>s-t</i> minimum cuts in <i>Õ</i>(<i>n</i><sup>2</sup>) time · 相关文章

暂无数据