K.M. Chung, Fabrizio Luccio, 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
Giancarlo Bongiovanni, C.K. Wong
IEEE TC
P.C. Yue, C.K. Wong
Journal of the ACM
K.M. Chung, C.K. Wong
IEEE TC