D.T. Lee, C.K. Wong
Acta Informatica
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.C. Yue, C.K. Wong
International Journal of Computer & Information Sciences
Conference paper
Wiring and crosstalk avoidance in multi-chip module design
Howard H. Chen, C.K. Wong
CICC 1992
Howard H. Chen, C.K. Wong
VLSI-TSA 1991