Metraipolis › archive › dc_f21ba400e810

Metric Dimension Parameterized by Bag-Connected Treewidth and Bag-Connected Pathwidth — arXiv:2611.09733

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.09733
License (as archived)
CC0-1.0
Archived
2026-11-09T22:47:41.200Z
SHA-256 of the archived text
0875b5f6632d8ec55eccc11da5d6d1fee323fe80afb817a4f80f52023ce84eb7
Stable URL of this page
https://metraipolis.com/documento/dc_f21ba400e810

How to cite

Metric Dimension Parameterized by Bag-Connected Treewidth and Bag-Connected Pathwidth — arXiv:2611.09733 — arXiv (en), https://arxiv.org/abs/2611.09733 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f21ba400e810 (Metraipolis archive dc_f21ba400e810, sha256 0875b5f6632d8ec55eccc11da5d6d1fee323fe80afb817a4f80f52023ce84eb7)
BibTeX
@misc{dcf21ba400e810,
  title = {Metric Dimension Parameterized by Bag-Connected Treewidth and Bag-Connected Pathwidth — arXiv:2611.09733},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09733},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f21ba400e810; sha256 0875b5f6632d8ec55eccc11da5d6d1fee323fe80afb817a4f80f52023ce84eb7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09733. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The metric dimension of a graph is the minimum size of a set of vertices whose distance vectors distinguish all vertices of the graph. We prove that \MetricDimension{} is NP-complete on planar graphs of treewidth and bag-connected treewidth exactly three. The graphs in our construction have no induced cycle longer than four and have (prefix-connected) pathwidth at most four. In particular, the problem admits no XP algorithm parameterized by bag-connected treewidth unless $\mathrm P=\mathrm{NP}$. This answers questions of Bonnet and Purohit and of Bousquet, Deschamps, and Parreau. We prove that the problem is fixed-parameter tractable when parameterized by bag-connected pathwidth.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2611.09733 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:40:59.897Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).