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...
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...
h-index: Number of publications with at least h citations each.