The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

DOI10.1007/978-3-642-34611-8_14zbMATH Open1341.05049DBLPconf/wg/EpsteinLW12OpenAlexW2170983254WikidataQ56551554 ScholiaQ56551554MaRDI QIDQ5200499FDOQ5200499

Gerhard J. Woeginger, Asaf Levin, Leah Epstein

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/the-weighted-metric-dimension-of-graphs--hard-and-easy-cases(f86db641-15c6-46a0-a1fc-6a69fd710049).html

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Distance in graphs (05C12)

Cited In (9)

• THE METRIC DIMENSION OF THE ANNIHILATING-IDEAL GRAPH OF A FINITE COMMUTATIVE RING
• Minimum weight resolving sets of grid graphs
• Metric Dimension of Bounded Width Graphs
• Metric dimension of complement of annihilator graphs associated with commutative rings
• The weighted 2-metric dimension of trees in the non-landmarks model
• The metric dimension of the zero-divisor graph of a matrix semiring
• Approximation for the minimum cost doubly resolving set problem
• Metric Dimension of Bounded Tree-length Graphs
• Computing the metric dimension for chain graphs

This page was built for publication: The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200499)