scientific article
From MaRDI portal
Publication:3549696
zbMath1231.68185MaRDI QIDQ3549696
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Computing Weighted Strength and Applications to Partitioning ⋮ Minimum Cuts and Sparsification in Hypergraphs ⋮ Clique Cover and Graph Separation ⋮ The vertex \(k\)-cut problem ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems ⋮ Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Finding minimum 3-way cuts in hypergraphs ⋮ Beating the 2-approximation factor for global bicut ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
This page was built for publication:
