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

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

Paper

Combining the perceptron algorithm with logarithmic simulated annealing

A. Albrecht, C.K. Wong

Neural Processing Letters

Paper

Bottleneck Steiner Trees in the Plane

M. Sarrafzadeh, C.K. Wong

IEEE TC

Paper

Bounds on algorithms for string generation

A.C. McKellar, C.K. Wong

Acta Informatica

View all publications