Metric Dimension Parameterized by Max Leaf Number
From MaRDI portal
Publication:2941747
DOI10.7155/jgaa.00360zbMath1327.05320arXiv1506.01749OpenAlexW3102164014WikidataQ56551552 ScholiaQ56551552MaRDI QIDQ2941747
Publication date: 25 August 2015
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.01749
Related Items (12)
Parameterized Complexity of Geodetic Set ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ Monitoring edge-geodetic sets in graphs ⋮ Computing the \(k\)-metric dimension of graphs ⋮ Computing the metric dimension of a graph from primary subgraphs ⋮ Alternative parameterizations of \textsc{Metric Dimension} ⋮ Metric dimension parameterized by treewidth ⋮ Hardness of metric dimension in graphs of constant treewidth ⋮ Parameterized Complexity of Geodetic Set ⋮ Metric Dimension of Bounded Tree-length Graphs
This page was built for publication: Metric Dimension Parameterized by Max Leaf Number
