For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Finding a Maximum Weight Independent Set of a Circle Graph
Takao ASANO Hiroshi IMAI Akira MUKAIYAMA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/25
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications)
Full Text: PDF>>
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.