2 search results - page 1 / 1 » A Global k-Level Crossing Reduction Algorithm |
WALCOM
2010
IEEE
13 years 12 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
DAC
2004
ACM
14 years 6 months ago
2004
ACM
For multi-gigahertz synchronous designs in nanometer technologies, multiple clock cycles are needed to cross the global interconnects, thus making it necessary to have pipelined g...