scientific article; zbMATH DE number 5485527

zbMATH Open1231.68185MaRDI QIDQ3549696FDOQ3549696

Authors: Mikkel Thorup 

Publication date: 5 January 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (22)

• Computing weighted strength and applications to partitioning
• Partitioning subclasses of chordal graphs with few deletions
• The vertex \(k\)-cut problem
• Minimum cuts and sparsification in hypergraphs
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
• Hypergraph \(k\)-cut in randomized polynomial time
• A polynomial time algorithm for finding a minimum 4-partition of a submodular function
• Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
• Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
• Finding minimum 3-way cuts in hypergraphs
• Computing minimum multiway cuts in hypergraphs
• Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
• 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
• Beating the 2-approximation factor for global bicut
• A parameterized approximation scheme for min \(k\)-cut
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
• Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
• Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
• Clique Cover and Graph Separation
• LP relaxation and tree packing for minimum \(k\)-cut

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)