Efficient algorithm for graph-partitioning problem using a problem transformation method (Q583241)
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: Efficient algorithm for graph-partitioning problem using a problem transformation method |
scientific article; zbMATH DE number 4132209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithm for graph-partitioning problem using a problem transformation method |
scientific article; zbMATH DE number 4132209 |
Statements
Efficient algorithm for graph-partitioning problem using a problem transformation method (English)
0 references
1989
0 references
electronic design automation
0 references
circuit partitioning
0 references
k-way graph- partitioning problem
0 references
Kernighan-Lin algorithm
0 references
maximum cutset
0 references
uniform k- way partitioning problem
0 references
max-cut problem
0 references
0.7849792838096619
0 references
0.7755248546600342
0 references
0.7653504014015198
0 references
0.7550785541534424
0 references
