Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth.
Tuukka KorhonenMarek SokolowskiPublished in: CoRR (2024)
Keyphrases
- preprocessing
- worst case
- cost function
- detection algorithm
- optimization algorithm
- optimal solution
- single pass
- search space
- k means
- computationally efficient
- np hard
- learning algorithm
- times faster
- dynamic programming
- segmentation algorithm
- expectation maximization
- significant improvement
- computational complexity
- convex hull
- selection algorithm
- suffix array
- experimental study
- neural network
- theoretical analysis
- linear programming
- simulated annealing
- objective function
- similarity measure
- genetic algorithm