Publication:4952694
From MaRDI portal
zbMath0957.68083MaRDI QIDQ4952694
Publication date: 10 May 2000
68R10: Graph theory (including graph drawing) in computer science
Related Items
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem, Minimal multicut and maximal integer multiflow: a survey, Finding minimum 3-way cuts in hypergraphs, Efficient algorithms for the problems of enumerating cuts by non-decreasing weights, Generating partitions of a graph into a fixed number of minimum weight cuts, Efficient Algorithms for the k Smallest Cuts Enumeration