Jin-Fuw Lee, D.T. Tang, 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
W.K. Luk, Paolo Sipala, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
X. Cai, T. Kloks, et al.
Networks