A Linear-Processor Algorithm for Depth-First Search in Planar Graphs.
Gregory E. ShannonPublished in: Inf. Process. Lett. (1988)
Keyphrases
- depth first search
- breadth first search
- np hard
- dynamic programming
- probabilistic model
- computational complexity
- optimal solution
- planar graphs
- spanning tree
- worst case
- routing problem
- search space
- particle swarm optimization
- expectation maximization
- tree structure
- benchmark problems
- minimum spanning tree
- evolutionary algorithm
- objective function