Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling (Q3399658)
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: Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling |
scientific article; zbMATH DE number 5613605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling |
scientific article; zbMATH DE number 5613605 |
Statements
Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling (English)
0 references
12 October 2009
0 references
2-way graph partitioning
0 references
Genetic Algorithm (GA)
0 references
Uniform Design Sampling (UDS)
0 references
genetic algorithm based on uniform design sampling (UGA)
0 references
0.7928043603897095
0 references
0.7691047191619873
0 references
0.7678452134132385
0 references
0.7595717906951904
0 references
0.7535660266876221
0 references
