Computing a metric basis of a 2-connected bipartite distance-hereditary graph

DOI10.1016/j.tcs.2019.11.031zbMath1436.68255OpenAlexW2991043383WikidataQ126668433 ScholiaQ126668433MaRDI QIDQ2283041

Marina Moscarini

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.031

zbMATH Keywords

bipartite graphdistance-hereditary graphhomogeneous setmetric generatormetric basishomogeneous metric set

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Computing a metric basis of a bipartite distance-hereditary graph

Cites Work

• A linear time algorithm for metric dimension of cactus block graphs
• Complexity of metric dimension on planar graphs
• The (weighted) metric dimension of graphs: hard and easy cases
• Computing the metric dimension of a graph from primary subgraphs
• Computing the metric dimension for chain graphs
• Landmarks in graphs
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• The Metric Dimension of Two-Dimensional Extended Meshes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing a metric basis of a 2-connected bipartite distance-hereditary graph