Metric Dimension Parameterized by Treewidth in Chordal Graphs

DOI10.1007/978-3-031-43380-1_10MaRDI QIDQ6496546zbMATH OpenFDO

Authors Nicolas Bousquet, Quentin Deschamps, Aline Parreau

Publication date 3 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43380-1_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Exploring the gap between treedepth and vertex cover through vertex integrity
• Hardness of metric dimension in graphs of constant treewidth
• 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?)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• Metric Dimension of Bounded Tree-length Graphs
• Metric dimension parameterized by treewidth
• On rigid circuit graphs
• On the Complexity of Metric Dimension
• The (weighted) metric dimension of graphs: hard and easy cases
• The effect of vertex or edge deletion on the metric dimension of graphs
• Treewidth. Computations and approximations

Cited in

(3)

• Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
• Enumerating minimal solution sets for metric graph problems
• Metric dimension and geodetic set parameterized by vertex cover

This page was built for publication: Metric Dimension Parameterized by Treewidth in Chordal Graphs

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