Abstract
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 Õ (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(nm log(n2/m)). © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Yeh, L. P., & Wang, B. F. (2008). Efficient algorithms for the k smallest cuts enumeration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 434–443). https://doi.org/10.1007/978-3-540-69733-6_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
