Abstract— This paper presents a post-route gate-sizing algorithm for coupling-noise reduction that constrains the yield loss under process variations. Algorithms for coupling-noi...
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
An unsupervised segmentation algorithm based on a multiresolution method is presented. This method uses variational functions as a segmentation criterion. The algorithm has been ap...
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...