An output sensitive algorithm for computing a maximum independent set of a circle graph

Authors:
Nicholas Nash;David Gregg
Affiliations:
Dept. of Computer Science, Trinity College, Dublin, Ireland;Lero, Trinity College, Dublin, Ireland
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

New clique and independent set algorithms for circle graphs

Discrete Applied Mathematics
The complexity of domination problems in circle graphs

Discrete Applied Mathematics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Efficiently implementing maximum independent set algorithms on circle graphs

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an output sensitive algorithm for computing a maximum independent set of an unweighted circle graph. Our algorithm requires O(nmin{d,@a}) time at worst, for an n vertex circle graph where @a is the independence number of the circle graph and d is its density. Previous algorithms for this problem required @Q(nd) time at worst.