Pages that link to "Item:Q2734604"
From MaRDI portal
The following pages link to A fast hypergraph min-cut algorithm for circuit partitioning (Q2734604):
Displaying 14 items.
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- A note on hypergraph decomposition based on extended minimal sets (Q1124611) (← links)
- Modeling hypergraphs by graphs with the same mincut properties (Q1209979) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions (Q6075748) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)
