On finding the best and worst orientations for the metric dimension

DOI10.1007/s00453-023-01132-0MaRDI QIDQ6093374

No author found.

Publication date: 6 October 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

digraphsmetric dimensionundirected graphsresolving sets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of metric dimension on planar graphs
• Domination and location in twin-free digraphs
• A simplified NP-complete satisfiability problem
• The metric dimension of Cayley digraphs
• On the minimum size of an identifying code over all orientations of a graph
• On the metric dimension of line graphs
• Symmetry breaking in tournaments
• Locating-dominating sets: from graphs to oriented graphs
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• The directed distance dimension of oriented graphs
• Directed Metric Dimension of Oriented Graphs with Cyclic Covering
• Metric dimension of directed graphs
• On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
• Metric dimension: from graphs to oriented graphs

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