Metric Dimension Parameterized by Bag-Connected Treewidth and Bag-Connected Pathwidth
cs.CC
Submitted: 2026-11-06
Updated: 2026-11-14
Terminology
Sources
- Metric Dimension is NP-complete on Graphs of Treewidth Two
- Model Checking for Metric Extensions of Monadic Second-Order Logic
- On the Hardness of Strong Metric Dimension
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?