Modeling hypergraphs by graphs with the same mincut properties
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 16298 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- A Gomory-Hu cut tree representation of a netlist partitioning problem
- A framework for solving VLSI graph layout problems
- An Algorithm for Partitioning the Nodes of a Graph
Cited in
(11)- Weighted fundamental group
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Spectral partitioning with multiple eigenvectors
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- A semidefinite programming approach to the hypergraph minimum bisection problem
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Comparing hypergraphs by areas of hyperedges drawn on a convex polygon
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Worst-case ratios of networks in the rectilinear plane
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
- Hypergraph Cuts with General Splitting Functions
This page was built for publication: Modeling hypergraphs by graphs with the same mincut properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209979)