An Improved Min-Cut Algonthm for Partitioning VLSI Networks (Q3312163): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tc.1984.1676460 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010346244 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved Min-Cut Algonthm for Partitioning VLSI Networks |
scientific article |
Statements
An Improved Min-Cut Algonthm for Partitioning VLSI Networks (English)
0 references
1984
0 references
min-cut partitions of VLSI networks
0 references
partitioning algorithms
0 references
VLSI layout
0 references
