scientific article; zbMATH DE number 1445372
From MaRDI portal
Publication:4952694
zbMath0957.68083MaRDI QIDQ4952694
Publication date: 10 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Efficient Algorithms for the k Smallest Cuts Enumeration ⋮ Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Unnamed Item ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Finding minimum 3-way cuts in hypergraphs
This page was built for publication: