Inder S. Gopal, Don Coppersmith, et al.
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
M. Sarrafzadeh, C.K. Wong
IEEE TC
Hongbing Fan, Yu-Liang Wu, et al.
Graphs and Combinatorics
Charles Chiang, Majid Sarrafzadeh, et al.
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications