A Novel eigenvector technique for large scale combinatorial problems in VLSI layout (Q1610660)
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 Novel eigenvector technique for large scale combinatorial problems in VLSI layout |
scientific article; zbMATH DE number 1784323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Novel eigenvector technique for large scale combinatorial problems in VLSI layout |
scientific article; zbMATH DE number 1784323 |
Statements
A Novel eigenvector technique for large scale combinatorial problems in VLSI layout (English)
0 references
20 August 2002
0 references
The idea is the application of a new matrix reordering technique by which a binary \(m\times n\)-matrix can be reordered such that the ones are clustered along the geometric diagonal as tightly as possible. The technique is based on the calculation of the second largest eigenvalue and the corresponding eigenvector of a related matrix.
0 references
circuit design
0 references
matrix reordering
0 references
0.7465940117835999
0 references
0.7075265049934387
0 references
