A. Albrecht, S.K. Cheung, et al.
Mathematics and Computers in Simulation
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
Gopalakriskhnan Vijayan, Howard H. Chen, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hongbing Fan, Yu-Liang Wu, et al.
Graphs and Combinatorics
C.K. Wong, P.C. Yue
Information Sciences