Journal of Algorithms

Paper

01 Jan 1998

Minimum Fill-in on Circle and Circular-Arc Graphs

View publication

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

Wiring and crosstalk avoidance in multi-chip module design

Howard H. Chen, C.K. Wong

CICC 1992

Paper

A Combinatorial Problem Related to Multimodule Memory Organizations

C.K. Wong, Don Coppersmith

Journal of the ACM

Paper

Near-optimal heuristics for an assignment problem in mass storage

P.C. Yue, C.K. Wong

International Journal of Computer & Information Sciences

Paper

New Algorithms for the Rectilinear Steiner Tree Problem

Jan-Ming Ho, Gopalakrishnan Vijayan, et al.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

View all publications