Pages that link to "Item:Q1209979"
From MaRDI portal
The following pages link to Modeling hypergraphs by graphs with the same mincut properties (Q1209979):
Displaying 10 items.
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Weighted fundamental group (Q2210198) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning (Q4594176) (← links)
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning (Q5197618) (← links)
