Jingsheng Cong, Andrew B. Kahng, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
Xiaoyun Lu, Da-Wei Wang, et al.
Discrete Mathematics
Kin-Man Chung, Fabrizio Luccio, et al.
IEEE TC
U.I. Gupta, D.T. Lee, et al.
Theoretical Computer Science