Hardness of Metric Dimension in Graphs of Constant Treewidth.
Shaohua LiMarcin PilipczukPublished in: Algorithmica (2022)
Keyphrases
- bounded treewidth
- maximum common subgraph
- np complete
- upper bound
- search space
- constraint graph
- graph matching
- graph theory
- space complexity
- metric space
- phase transition
- boolean functions
- evaluation metrics
- information theoretic
- graph clustering
- graph mining
- weighted graph
- distance measure
- directed graph
- distance metric
- discrete random variables
- np hard
- computational complexity
- random graphs
- graph structure
- graph theoretic
- graph partitioning
- graph model
- learning theory
- distance function
- constraint satisfaction problems