An Exponential Time Parameterized Algorithm for Planar Disjoint Paths.
Daniel LokshtanovPranabendu MisraMichal PilipczukSaket SaurabhMeirav ZehaviPublished in: CoRR (2021)
Keyphrases
- preprocessing
- experimental evaluation
- times faster
- detection algorithm
- search space
- improved algorithm
- dynamic programming
- np hard
- high accuracy
- computationally efficient
- theoretical analysis
- expectation maximization
- linear complexity
- graph structure
- matching algorithm
- clustering method
- segmentation algorithm
- learning algorithm
- worst case
- computational cost
- k means
- optimization algorithm
- convergence rate
- evolutionary algorithm
- similarity measure