scientific article; zbMATH DE number 5485527
From MaRDI portal
Publication:3549696
Cited in
(24)- Computing minimum multiway cuts in hypergraphs
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- Hypergraph \(k\)-cut in randomized polynomial time
- Beating the 2-approximation factor for global bicut
- The vertex \(k\)-cut problem
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Clique Cover and Graph Separation
- LP relaxation and tree packing for minimum k-cut
- Computing weighted strength and applications to partitioning
- Minimum cuts and sparsification in hypergraphs
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Fast and Deterministic Approximations for k-Cut.
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Partitioning subclasses of chordal graphs with few deletions
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- A parameterized approximation scheme for min \(k\)-cut
- An algorithm for packing hypertrees
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Finding minimum 3-way cuts in hypergraphs
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549696)
