Complexity of metric dimension on planar graphs
From MaRDI portal
(Redirected from Publication:314819)
Recommendations
- On the Complexity of Metric Dimension
- On the metric dimension of a graph
- Metric dimension of maximal outerplanar graphs
- On metric dimension of graphs and their complements
- On the complexity of embedding planar graphs to minimize certain distance measures
- Computing the \(k\)-metric dimension of graphs
- The metric dimension and girth of graphs
- scientific article; zbMATH DE number 6739348
- Asymptotic dimension of planes and planar graphs
Cites work
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 4121424 (Why is no real title available?)
- scientific article; zbMATH DE number 6456550 (Why is no real title available?)
- scientific article; zbMATH DE number 6783430 (Why is no real title available?)
- Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation complexity of metric dimension problem
- Base size, metric dimension and other invariants of groups and graphs
- Bidimensionality: new connections between FPT algorithms and PTASs
- Computing the metric dimension for chain graphs
- Efficient Planarity Testing
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Landmarks in graphs
- Locating a robber on a graph via distance queries
- Metric dimension of bounded width graphs
- Notions of metric dimension of corona products: combinatorial and computational results
- On the Metric Dimension of Cartesian Products of Graphs
- Resolvability in graphs and the metric dimension of a graph
- The (weighted) metric dimension of graphs: hard and easy cases
- The Complexity of Multiterminal Cuts
Cited in
(24)- Metric dimension parameterized by max leaf number
- Computing metric dimension of two types of claw-free cubic graphs with applications
- Approximation complexity of metric dimension problem
- Metric dimension of directed graphs
- The (weighted) metric dimension of graphs: hard and easy cases
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
- Metric dimension parameterized by treewidth
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- A note on the complexity of \(k\)\textsc{-metric dimension}
- Alternative parameterizations of \textsc{Metric Dimension}
- Computing a metric basis of a bipartite distance-hereditary graph
- On approximation complexity of metric dimension problem
- On finding the best and worst orientations for the metric dimension
- Computing the \(k\)-metric dimension of graphs
- Computing a metric basis of a 2-connected bipartite distance-hereditary graph
- On metric dimension of plane graphs $\mathfrak{J}_{n}$, $\mathfrak{K}_{n}$ and $\mathfrak{L}_{n}$
- Metric dimension: from graphs to oriented graphs
- Local metric dimension for graphs with small clique numbers
- The Plancherel measure for polygonal graphs
- On the Complexity of Metric Dimension
- Metric dimension of maximal outerplanar graphs
- Sequential metric dimension
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Hardness of metric dimension in graphs of constant treewidth
This page was built for publication: Complexity of metric dimension on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314819)
