Jan-Ming Ho, G. Vijayan, et al.
Integration, the VLSI Journal
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
C.K. Wong, P.C. Yue
Discrete Mathematics
Howard H. Chen, C.K. Wong
APCCAS 1994
A. Albrecht, C.K. Wong
Neural Processing Letters