On the complexity of submap isomorphism and maximum common submap problems.
Christine SolnonGuillaume DamiandColin de la HigueraJean-Christophe JanodetPublished in: Pattern Recognit. (2015)
Keyphrases
- solving problems
- decision problems
- np hardness
- artificial neural networks
- information retrieval
- polynomial hierarchy
- difficult problems
- problems involving
- computational cost
- information systems
- database
- dynamic programming
- upper bound
- multi class
- worst case
- high dimensional
- data structure
- decision trees
- related problems
- practical problems
- search engine