Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs

DOI10.1007/s10878-020-00575-3zbMath1502.90183OpenAlexW4249320394MaRDI QIDQ2082215

Qingjie Ye, Chengru Zhu, Chang-hong Lu

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00575-3

zbMATH Keywords

block graphcactus graphdoubly resolving set\(k\)-edge-augmented trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• The (weighted) metric dimension of graphs: hard and easy cases
• Labelling algorithms for paired-domination problems in block and interval graphs
• Computing minimal doubly resolving sets of graphs
• Resolvability in graphs and the metric dimension of a graph
• Landmarks in graphs
• Minimal doubly resolving sets of prism graphs
• On the Complexity of Metric Dimension
• Approximability of the Minimum Weighted Doubly Resolving Set Problem
• Base size, metric dimension and other invariants of groups and graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Rumors in a Network: Who's the Culprit?
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs