Complexity of metric dimension on planar graphs.

Josep Díaz,Olli Pottonen,Maria J. Serna,Erik Jan van Leeuwen

Journal of Computer and System Sciences（2017）

引用 25|浏览83

暂无评分

摘要

•In Metric Dimension, we distinguish all pairs of vertices by few selected landmarks.•We show that Metric Dimension is NP-complete on planar graphs.•We show that Metric Dimension has a polynomial-time algorithm on outerplanar graphs.•This closes a 30-year old complexity gap for Metric Dimension.

查看译文

关键词

Metric dimension,Planar graph,Outerplanar graph,NP-completeness

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要