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
C.K. Wong
Proceedings of the American Mathematical Society
Conference paper
Wiring and crosstalk avoidance in multi-chip module design
Howard H. Chen, C.K. Wong
CICC 1992
Conference paper
Bounded-diameter minimum spanning trees and related problems
Jan-Ming Ho, D.T. Lee, et al.
SCG 1989