Application of parallel and hybrid metaheuristics for graph partitioning problem (Q2420031)
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: Application of parallel and hybrid metaheuristics for graph partitioning problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Application of parallel and hybrid metaheuristics for graph partitioning problem |
scientific article |
Statements
Application of parallel and hybrid metaheuristics for graph partitioning problem (English)
0 references
5 June 2019
0 references
graph partitioning
0 references
circuit partitioning
0 references
parallel metaheuristics
0 references
hybrid metaheuristics
0 references
approximate algorithms
0 references
DIMACS graphs
0 references
R-MAT graphs
0 references
0.9604093
0 references
0.9018195
0 references
0.88983583
0 references
0.8892449
0 references
0 references
0.8877286
0 references
0 references
