Howard H. Chen, C.K. Wong
VLSI-TSA 1991
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
C.K. Wong
Trans. Am. Math. Soc.
Majid Sarrafzadeh, C.K. Wong
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Charles Chiang, Majid Sarrafzadeh, et al.
International Journal of Circuit Theory and Applications