W.D. Frazer, C.K. Wong
CACM
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
Guochuan Zhang, Xiaoqiang Cai, et al.
IIE Transactions
Charles Chiang, Majid Sarrafzadeh, et al.
International Journal of Circuit Theory and Applications