Xiaoyun Lu, Da-Wei Wang, et al.
Graphs and Combinatorics
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
C.K. Wong
Trans. Am. Math. Soc.
A. Albrecht, E. Hein, et al.
Artificial Intelligence in Medicine