Efficient algorithm for graph-partitioning problem using a problem transformation method (Q583241): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:28, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithm for graph-partitioning problem using a problem transformation method |
scientific article |
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