Hardness of Metric Dimension in Graphs of Constant Treewidth.
Shaohua LiMarcin PilipczukPublished in: CoRR (2021)
Keyphrases
- bounded treewidth
- np complete
- maximum common subgraph
- upper bound
- constraint graph
- search space
- graph theory
- boolean functions
- graph matching
- np hard
- metric space
- phase transition
- distance metric
- graph structure
- directed graph
- space complexity
- worst case
- graph data
- graph partitioning
- graph databases
- evaluation metrics
- learning theory
- metric learning
- relational learning
- graph theoretic
- constraint satisfaction
- decision problems
- intrinsic dimension
- tree decompositions
- computational complexity