Charles Chiang, Majid Sarrafzadeh, et al.
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
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
M. Tamminen, W.K. Luk, et al.
Acta Informatica
Jin-Fuw Lee, D.T. Tang, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems