Planar Metric Dimension is NP-complete
Josep DíazOlli PottonenErik Jan van LeeuwenPublished in: CoRR (2011)
Keyphrases
- np complete
- randomly generated
- np hard
- computational complexity
- satisfiability problem
- polynomial time complexity
- pspace complete
- phase transition
- data complexity
- constraint satisfaction problems
- conjunctive queries
- metric space
- evaluation metrics
- bounded treewidth
- neural network
- distance measure
- intrinsic dimension
- euclidean distance
- metric learning
- similarity metric
- query language
- temporal dimension
- lower bound
- objective function