D.T. Lee, C.L. Liu, et al.
Theoretical Computer Science
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
Conference paper
Hierarchical global wiring for custom chip design
W.K. Luk, D.T. Tang, et al.
DAC 1986
A. Albrecht, S.K. Cheung, et al.
Mathematics and Computers in Simulation
Conference paper
Bounded-diameter minimum spanning trees and related problems
Jan-Ming Ho, D.T. Lee, et al.
SCG 1989