Computational complexity of long paths and cycles in faulty hypercubes.
Tomás DvorákVáclav KoubekPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- computational complexity
- np complete
- high computational complexity
- special case
- fault diagnosis
- computational cost
- memory requirements
- neural network
- low complexity
- computational efficiency
- motion vectors
- computationally efficient
- video sequences
- genetic algorithm
- real world
- shortest path
- image sequences
- website
- artificial intelligence
- decision problems
- optimal path
- database
- long sequences