Pages that link to "Item:Q2912859"
From MaRDI portal
The following pages link to On the Complexity of Metric Dimension (Q2912859):
Displaying 40 items.
- A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- Computing the metric dimension of a graph from primary subgraphs (Q503686) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- Extending the metric dimension to graphs with missing edges (Q897908) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- The weighted 2-metric dimension of trees in the non-landmarks model (Q1751125) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Computing the metric dimension for chain graphs (Q2346556) (← links)
- On the limiting distribution of the metric dimension for random forests (Q2349959) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- The \(k\)-metric dimension (Q2410025) (← links)
- On the metric dimension of HDN (Q2447530) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Metric Dimension Parameterized by Max Leaf Number (Q2941747) (← links)
- Metric Dimension for Amalgamations of Graphs (Q2946069) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- THE METRIC DIMENSION OF THE ANNIHILATING-IDEAL GRAPH OF A FINITE COMMUTATIVE RING (Q4989462) (← links)
- Amorphic complexity can take any nonnegative value in general metric spaces (Q4994903) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases (Q5200499) (← links)
- Hyperbolic Dimension and Decomposition Complexity (Q5216939) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- Metric dimension parameterized by treewidth (Q5875537) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- The metric dimension of the zero-divisor graph of a matrix semiring (Q6090825) (← links)
- On finding the best and worst orientations for the metric dimension (Q6093374) (← links)
- A note on the complexity of \(k\)\textsc{-metric dimension} (Q6096304) (← links)
- Mixed metric dimension over (edge) corona products (Q6643342) (← links)
