An efficient eigenvector approach for finding netlist partitions
A fast eigenvector technique for obtaining good initial node partitions of netlists for use in interchange heuristics is described. The method is based on approximating the netl...
Publications
2 shownDiscrete random variables
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Frequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 2
- Citations
- 76
- Institution
- University of Waterloo
External Links
Identifiers
- ORCID
- 0000-0002-4030-5592
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.