A Gomory-Hu cut tree representation of a netlist partitioning problem (Q3360809)
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: A Gomory-Hu cut tree representation of a netlist partitioning problem |
scientific article; zbMATH DE number 4213924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Gomory-Hu cut tree representation of a netlist partitioning problem |
scientific article; zbMATH DE number 4213924 |
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
0.8154726028442383
0 references
0.8154726028442383
0 references
0.8060557246208191
0 references
0.7720179557800293
0 references
