Pages that link to "Item:Q450564"

The following pages link to Approximation complexity of metric dimension problem (Q450564):

Displaying 22 items.

• A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
• Complexity of metric dimension on planar graphs (Q314819) (← links)
• The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
• On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
• Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
• The weighted 2-metric dimension of trees in the non-landmarks model (Q1751125) (← links)
• Metric dimension of critical Galton-Watson trees and linear preferential attachment trees (Q2033923) (← links)
• Computation of edge resolvability of benzenoid tripod structure (Q2051719) (← links)
• The locating number of hexagonal Möbius ladder network (Q2053208) (← links)
• On the robustness of the metric dimension of grid graphs to adding a single edge (Q2143039) (← links)
• On approximation algorithm for the edge metric dimension problem (Q2220845) (← links)
• Low-dimensional representation of genomic sequences (Q2311893) (← links)
• Computing the metric dimension for chain graphs (Q2346556) (← links)
• On the limiting distribution of the metric dimension for random forests (Q2349959) (← links)
• The \(k\)-metric dimension (Q2410025) (← links)
• Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
• Vertex identification in trees (Q5051441) (← links)
• Resolvability of Hamming Graphs (Q5128504) (← links)
• Sharp bound on the truncated metric dimension of trees (Q6041544) (← links)
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
• A note on the complexity of \(k\)\textsc{-metric dimension} (Q6096304) (← links)
• The fault‐tolerant beacon set of hexagonal Möbius ladder network (Q6184060) (← links)