K.M. Chung, C.K. Wong
IEEE TC
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
Charles Chiang, Majid Sarrafzadeh, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Y.F. Wu, P. Widmayer, et al.
Acta Informatica
Howard H. Chen, C.K. Wong
VLSI-TSA 1993