Cutsets and partitions of hypergraphs
From MaRDI portal
Cited in
(31)- A note on hypergraph decomposition based on extended minimal sets
- A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy
- Greedy splitting algorithms for approximating multiway partition problems
- Computing minimum multiway cuts in hypergraphs
- On generalized greedy splitting algorithms for multiway partition problems
- On some algorithmic aspects of hypergraphic matroids
- Hypergraph \(k\)-cut in randomized polynomial time
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Formalising and detecting community structures in real world complex networks
- Submodular Cost Allocation Problem and Applications
- Minimum cuts and sparsification in hypergraphs
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Hypergraph Cuts with General Splitting Functions
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Posimodular function optimization
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Comparing the principal eigenvector of a hypergraph and its shadows
- Hypergraph analysis based on a compatible tensor product structure
- Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- Linearly representable submodular functions: an algebraic algorithm for minimization
- Scalable high-quality hypergraph partitioning
- Minimum s-t hypercut in (s, t)-planar hypergraphs
- Hyperpath deletion in directed hypergraphs
- Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game
- Near-optimal hypergraph sparsification in insertion-only and bounded-deletion streams
- Finding minimum 3-way cuts in hypergraphs
- LS sets as cohesive subsets of graphs and hypergraphs
- Minimum degree orderings
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
This page was built for publication: Cutsets and partitions of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5677525)
