Design and implementation of move-based heuristics for VLSI hypergraph partitioning (Q5463400): 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.1145/351827.384247 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982992099 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:04, 20 March 2024
scientific article; zbMATH DE number 2192035
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Design and implementation of move-based heuristics for VLSI hypergraph partitioning |
scientific article; zbMATH DE number 2192035 |
Statements
Design and implementation of move-based heuristics for VLSI hypergraph partitioning (English)
0 references
4 August 2005
0 references
Algorithms
0 references
Experimentation
0 references
Measurement
0 references
Performance
0 references
Balanced min-cut hypergraph partitioning
0 references
VLSI CAD
0 references
