[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 115 || Minimum s-t cut of a planar undirected network in o(n log2(n)) time
Even, Shimon; Kariv, Oded
- 作者Even, Shimon; Kariv, Oded
- 文件大小603.58KB
- 发表时间1981
- DOI10.1007/3-540-10843-2_5
- 页码56-67