'The Institute of Electronics, Information and Communication Engineers'
Abstract
We present an algorithm for finding a maximum weight independent set of a circle graph. For a cicle graph of a set of n chords with N endpoints, the algorithm finds a maximum weight independent set in O(nN) time and O(n) space.Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications
