Conference paper
Hierarchical global wiring for custom chip design
W.K. Luk, D.T. Tang, et al.
DAC 1986
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
D.T. Lee, C.D. Yang, et al.
Discrete Applied Mathematics
J. Nievergelt, J. Pradels, et al.
Information Processing Letters
Ashok K. Chandra, D.S. Hirschberg, et al.
Theoretical Computer Science