Cutsets and partitions of hypergraphs

From MaRDI portal
Publication:5677525

DOI10.1002/net.3230030306zbMath0262.05126OpenAlexW2011646234MaRDI QIDQ5677525

Eugene L. Lawler

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030306



Related Items

On generalized greedy splitting algorithms for multiway partition problems, Minimum degree orderings, Minimum Cuts and Sparsification in Hypergraphs, Formalising and detecting community structures in real world complex networks, A note on hypergraph decomposition based on extended minimal sets, Hypergraph Cuts with General Splitting Functions, Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs, Comparing the principal eigenvector of a hypergraph and its shadows, Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems, Hypergraph analysis based on a compatible tensor product structure, Hypergraph \(k\)-cut in randomized polynomial time, Submodular Cost Allocation Problem and Applications, Greedy splitting algorithms for approximating multiway partition problems, A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy, Computing minimum multiway cuts in hypergraphs, Fixed parameter approximation scheme for min-max \(k\)-cut, Posimodular function optimization, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Fixed parameter approximation scheme for min-max \(k\)-cut, Finding minimum 3-way cuts in hypergraphs, On some algorithmic aspects of hypergraphic matroids, LS sets as cohesive subsets of graphs and hypergraphs, Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning



Cites Work