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; zbMATH DE number 6059771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices |
scientific article; zbMATH DE number 6059771 |
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
0 references
0 references
0.90764976
0 references
0.9068183
0 references
0.89722306
0 references
0.89682066
0 references
0.89580846
0 references
0.89174694
0 references
0.8890078
0 references
0.8885789
0 references
0.8809935
0 references
