An output sensitive algorithm for computing a maximum independent set of a circle graph.
Nicholas NashDavid GreggPublished in: Inf. Process. Lett. (2010)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- matching algorithm
- expectation maximization
- np hard
- graph based algorithm
- k means
- similarity measure
- input data
- probabilistic model
- preprocessing
- objective function
- special case
- search space
- random walk
- shortest path
- computational complexity
- polynomial time complexity