A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.
Derrick StoleeChris BourkeN. V. VinodchandranPublished in: Computational Complexity Conference (2010)
Keyphrases
- np hard
- computational complexity
- optimization algorithm
- worst case
- computational cost
- cost function
- preprocessing
- higher dimensional
- search space
- dynamic programming
- experimental evaluation
- optimal solution
- detection algorithm
- space requirements
- high accuracy
- space complexity
- recognition algorithm
- learning algorithm
- theoretical analysis
- particle swarm optimization
- probabilistic model
- times faster
- data sources
- evolutionary algorithm
- data structure
- equivalence classes
- genetic algorithm