Algorithms and hardness for Metric Dimension on digraphs

DOI10.1007/978-3-031-43380-1_17MaRDI QIDQ6444186zbMATH OpenOpenAlexFDO

Authors Antoine Dailly, Florent Foucaud, Anni Hakanen

Publication date 18 July 2023

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

Mathematics Subject Classification ID

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

Cited in

(2)

• Algorithms and hardness for metric dimension on digraphs
• Algorithms and hardness for geodetic set on tree-like digraphs

This page was built for publication: Algorithms and hardness for Metric Dimension on digraphs

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