David M. Choy, C.K. Wong
BIT
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
X. Cai, T. Kloks, et al.
Networks
P. Widmayer, L. Woo, et al.
Integration, the VLSI Journal
A. Albrecht, S.K. Cheung, et al.
Journal of Computational Physics