On approximation algorithm for the edge metric dimension problem

DOI10.1007/978-3-030-27195-4_13MaRDI QIDQ6199010zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmssubmodular functionedge metric dimensionedge metric generator

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distance in graphs (05C12)

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

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)