Yuh-Zen Liao, C.K. Wong
IEEE TCADIS
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
Shou-Hsuan Stephen Huang, C.K. Wong
BIT
P.C. Yue, C.K. Wong
Journal of the ACM
Y.F. Wu, P. Widmayer, et al.
Acta Informatica