C. Chiang, C.K. Wong, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
Hongbing Fan, Yu-Liang Wu, et al.
Graphs and Combinatorics
K.M. Chung, F. Luccio, et al.
Information Processing Letters
Jan Ming Ho, Majid Sarrafzadeh, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems