共 15 条
ALGORITHMS FOR ENUMERATING ALL THE s-t CUTSETS IN O( vertical V vertical plus vertical E vertical ) PER CUTSET.
被引:0
|作者:
Ariyoshi, Hiromu
Tsukiyama, Shuji
Shirakawa, Isao
Ozaki, Hiroshi
机构:
来源:
关键词:
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The paper proposes two new algorithms to enumerate all the s-t cutsets with the worst-case time complexity of O((n plus m) multiplied by (times) (v plus 1)): one with space complexity of O(n**2) and the other of O(n plus m).
引用
收藏
页码:9 / 20
相关论文