Hardness of Metric Dimension in Graphs of Constant Treewidth.
Shaohua LiMarcin PilipczukPublished in: IPEC (2021)
Keyphrases
- bounded treewidth
- maximum common subgraph
- np complete
- graph structure
- space complexity
- constraint graph
- distance measure
- upper bound
- search space
- graph representation
- graph matching
- worst case
- intrinsic dimension
- graph theoretic
- directed graph
- metric space
- learning theory
- relational learning
- phase transition
- tree decompositions
- constraint satisfaction problems
- weighted graph
- discrete random variables
- subgraph isomorphism
- graph clustering
- graph data
- graph databases
- constraint propagation
- boolean functions
- distance metric
- euclidean distance
- special case