C.K. Wong
Proceedings of the American Mathematical Society
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
C.K. Wong, Shi-Kuo Chang
IEEE TC
Hongbing Fan, Yu-Liang Wu, et al.
Graphs and Combinatorics
M. Schlag, L. Woo, et al.
Integration, the VLSI Journal