A.C. McKellar, 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
Shen Lin, C.K. Wong
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
P. Widmayer, L. Woo, et al.
Integration, the VLSI Journal
K.M. Chung, C.K. Wong
IEEE TC