Conference paper
Process-variation-tolerant zero skew clock routing
Shen Lin, C.K. Wong
Annual ASIC Conference and Exhibit 1993
Paper
Minimum Fill-in on Circle and Circular-Arc Graphs
Abstract
We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in time O(n3). © 1998 Academic Press.
Related
Inder S. Gopal, Don Coppersmith, et al.
IEEE TC
G.Y. Yan, J.F. Pan, et al.
Graphs and Combinatorics
M. Sarrafzadeh, C.K. Wong
IEEE TC