Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices |
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
