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
U.I. Gupta, D.T. Lee, et al.
Theoretical Computer Science
C.K. Wong
ACM Computing Surveys (CSUR)
Jan-Ming Ho, Gopalakrishnan Vijayan, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems