On approximation algorithm for the edge metric dimension problem
DOI10.1007/978-3-030-27195-4_13OpenAlexW2964379911MaRDI QIDQ6199010FDOQ6199010
Authors: Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao 
Publication date: 23 February 2024
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-27195-4_13
Recommendations
- On approximation algorithm for the edge metric dimension problem
- Approximation complexity of metric dimension problem
- On approximation complexity of metric dimension problem
- Uniquely identifying the edges of a graph: the edge metric dimension
- Asymptotic behavior of the edge metric dimension of the random graph
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distance in graphs (05C12)
This page was built for publication: On approximation algorithm for the edge metric dimension problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199010)
