Efficient Algorithms for the k Smallest Cuts Enumeration
In this paper, we study the problems of enumerating cuts of a graph by non-decreasing weights. There are four problems, depending on whether the graph is directed or undirected, and on whether we consider all cuts of the graph or only s-t cuts for a given pair of vertices s, t. Efficient algorithms for these problems with 6(n2m) delay between two successive outputs have been known since 1992, due to Vazirani and Yannakakis. In this paper, improved algorithms are presented. The delays of the presented algorithms are O(nmlog(n2/m)).
Li-Pu Yeh Biing-Feng Wang
Department of Computer Science, National Tsing Hua University Hsinchu, Taiwan 30043 Department of Computer Science,National Tsing Hua University Hsinchu, Taiwan 30043
国际会议
The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)
大连
英文
434-443
2008-06-01（万方平台首次上网日期，不代表论文的发表时间）