On finding the best and worst orientations for the metric dimension

DOI10.1007/S00453-023-01132-0MaRDI QIDQ6093374zbMATH OpenFDO

Authors

Publication date 6 October 2023

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-023-01132-0

zbMATH Keywords

digraphsmetric dimensionresolving setsundirected graphs

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Recommendations

• scientific article; zbMATH DE number 3967416
• On the Complexity of Metric Dimension
• Metric dimension: from graphs to oriented graphs
• Metric dimension: from graphs to oriented graphs
• scientific article; zbMATH DE number 4105728
• On the metric dimension of rotationally-symmetric convex polytopes
• On the metric dimensions for sets of vertices
• On the metric dimension of convex polytopes
• On the metric dimension of certain metric manifolds
• Optimal st-Orientations for Plane Triangulations

Cites work

• A simplified NP-complete satisfiability problem
• Complexity of metric dimension on planar graphs
• Directed metric dimension of oriented graphs with cyclic covering
• Domination and location in twin-free digraphs
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• Graph theory with applications
• scientific article; zbMATH DE number 3467157 (Why is no real title available?)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• Locating-dominating sets: from graphs to oriented graphs
• Metric dimension of directed graphs
• Metric dimension: from graphs to oriented graphs
• On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
• On the metric dimension of line graphs
• On the minimum size of an identifying code over all orientations of a graph
• Symmetry breaking in tournaments
• The directed distance dimension of oriented graphs
• The metric dimension of Cayley digraphs

Cited in

(2)

• Parameterizing path partitions
• Algorithms and hardness for metric dimension on digraphs

This page was built for publication: On finding the best and worst orientations for the metric dimension

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