Metric dimension of bounded width graphs

DOI10.1007/978-3-662-48054-0_10MaRDI QIDQ2946381zbMATH OpenOpenAlexWikidataFDO

Authors Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48054-0_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Metric Dimension of Bounded Tree-length Graphs
• Metric dimension parameterized by treewidth
• scientific article; zbMATH DE number 7650213
• Alternative parameterizations of \textsc{Metric Dimension}
• Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components

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 2159659 (Why is no real title available?)
• scientific article; zbMATH DE number 1875437 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A survey of the algorithmic aspects of modular decomposition
• Fundamentals of parameterized complexity
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• Landmarks in graphs
• On the Complexity of Metric Dimension
• On the complexity of computing treelength
• Parameterized Algorithms for Modular-Width
• Parametrized complexity theory.
• Resolvability in graphs and the metric dimension of a graph
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• The (weighted) metric dimension of graphs: hard and easy cases
• Transitiv orientierbare Graphen
• Tree-decompositions with bags of small diameter
• Treewidth for graphs with small chordality
• Treewidth. Computations and approximations

Cited in

(16)

• The threshold dimension and irreducible graphs
• Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
• Metric dimension and edge metric dimension of windmill graphs
• Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
• Complexity of metric dimension on planar graphs
• Metric dimension parameterized by treewidth
• scientific article; zbMATH DE number 7650213 (Why is no real title available?)
• Alternative parameterizations of \textsc{Metric Dimension}
• Source detection on graphs
• Metric Dimension of Bounded Tree-length Graphs
• Iterated Type Partitions
• To approximate treewidth, use treelength!
• Hardness of metric dimension in graphs of constant treewidth
• The threshold dimension and threshold strong dimension of a graph: a survey
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• The threshold dimension of a graph

This page was built for publication: Metric dimension of bounded width graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946381)