M. Tamminen, W.K. Luk, et al.
Acta Informatica
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
P.C. Yue, C.K. Wong
Journal of the ACM
Guochuan Zhang, Xiaoqiang Cai, et al.
IIE Transactions
Howard H. Chen, C.K. Wong
VLSI-TSA 1993