W.D. Frazer, C.K. Wong
CACM
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
A.C. McKellar, C.K. Wong
Acta Informatica
Jan-Ming Ho, Majid Sarrafzadeh, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Yan Guiying, Jiaofeng Pan, et al.
Hokkaido Mathematical Journal