Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SparseMatrix / rank | |||
Normal rank | |||
Revision as of 12:41, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices |
scientific article |
Statements
Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (English)
0 references
26 July 2012
0 references
hypergraph partitioning
0 references
multi-level paradigm
0 references
recursive bisection
0 references
direct \(K\)-way refinement
0 references
multi-constraint
0 references
fixed vertices
0 references
