A. Albrecht, S.K. Cheung, et al.
IEEE TC
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
Hongbing Fan, Yu-Liang Wu, et al.
Graphs and Combinatorics
Conference paper
Provably good algorithms for performance-driven global routing
J. Cong, A. Kahng, et al.
ISCAS 1992
Shen Lin, C.K. Wong
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems