A Faster Algorithm for Maximum Induced Matchings on Circle Graphs.
Max WardAndrew GozzardMichael J. WiseAmitava DattaPublished in: J. Graph Algorithms Appl. (2018)
Keyphrases
- experimental evaluation
- k means
- graph structure
- cost function
- theoretical analysis
- segmentation algorithm
- optimal solution
- preprocessing
- improved algorithm
- np hard
- high accuracy
- adjacency graph
- optimization algorithm
- dynamic programming
- computational complexity
- memory efficient
- convergence rate
- times faster
- expectation maximization
- matching algorithm
- tree structure
- shortest path
- computationally efficient
- genetic algorithm
- linear programming
- significant improvement
- similarity measure
- learning algorithm