Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
From MaRDI portal
Publication:3032277
DOI10.1007/BF01074775zbMath0691.05024OpenAlexW1978918340MaRDI QIDQ3032277
No author found.
Publication date: 1986
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01074775
Related Items
Canonical cactus representation for miminum cuts ⋮ Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Graphs with largest number of minimum cuts ⋮ The firebreak problem ⋮ Efficient Algorithms for the k Smallest Cuts Enumeration ⋮ Unnamed Item ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Separating maximally violated comb inequalities in planar graphs ⋮ A linear time algorithm for computing 3-edge-connected components in a multigraph ⋮ Game edge-connectivity of graphs ⋮ Approximation algorithms for graph augmentation ⋮ Suboptimal cuts: Their enumeration, weight and number ⋮ Extracting maximal information about sets of minimum cuts ⋮ Characterizing the flow equivalent trees of a network
