Metric dimension parameterized by treewidth
type: Item
instance of: scholarly article
title: Metric dimension parameterized by treewidth
author: Édouard Bonnet
author: Nidhi Purohit
published in: Algorithmica
publication date: 2021-07-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1907.08093
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7374885
zbMATH Keywords: metric dimension
zbMATH Keywords: treewidth
zbMATH Keywords: parameterized hardness
MaRDI profile type: Publication
OpenAlex ID: W2996877459
cites work: On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Metric Dimension of Bounded Tree-length Graphs
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: Parameterized Algorithms
cites work: Complexity of metric dimension on planar graphs
cites work: Fundamentals of parameterized complexity
cites work: Metric Dimension Parameterized by Max Leaf Number
cites work: The (weighted) metric dimension of graphs: hard and easy cases
cites work: Computing the metric dimension for chain graphs
cites work: Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
cites work: Q4198056
cites work: Q4119237
cites work: A linear time algorithm for metric dimension of cactus block graphs
cites work: Which problems have strongly exponential complexity?
cites work: Landmarks in graphs
cites work: Interval graphs and searching
cites work: Q4904144
cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
cites work: Q4075485
DOI: 10.1007/S00453-021-00808-9
description: scientific article; zbMATH DE number 7374885