Efficient algorithm for graph-partitioning problem using a problem transformation method (Q583241): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0010-4485(89)90159-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964201692 / rank | |||
Normal rank | |||
Latest revision as of 01:29, 20 March 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
