Guochuan Zhang, Xiaoqiang Cai, et al.
IIE Transactions
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
P. Widmayer, C.K. Wong
Information Processing Letters
Shou-Hsuan Stephen Huang, C.K. Wong
BIT
Conference paper
Process-variation-tolerant zero skew clock routing
Shen Lin, C.K. Wong
Annual ASIC Conference and Exhibit 1993