Sciweavers

534 search results - page 26 / 107
» Diameter critical graphs
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
14 years 1 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
14 years 4 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
ARSCOM
2007
77views more  ARSCOM 2007»
13 years 9 months ago
Extremal bipartite graphs with high girth
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
Camino Balbuena, Pedro García-Vázque...
ICML
2007
IEEE
14 years 10 months ago
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
Jure Leskovec, Christos Faloutsos
PKDD
2005
Springer
155views Data Mining» more  PKDD 2005»
14 years 3 months ago
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...