A Gomory-Hu cut tree representation of a netlist partitioning problem (Q3360809): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Scott W. Hadley / rank | |||
| Property / author | |||
| Property / author: Scott W. Hadley / rank | |||
Normal rank | |||
| 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/31.57601 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170314243 / rank | |||
Normal rank | |||
Latest revision as of 23:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Gomory-Hu cut tree representation of a netlist partitioning problem |
scientific article |
Statements
A Gomory-Hu cut tree representation of a netlist partitioning problem (English)
0 references
1990
0 references
netlist partitions in VLSI design
0 references
hypergraph representation of netlists
0 references
weighted undirected graph
0 references
cut tree
0 references
design of VLSI layouts
0 references
