Distance Guarding Problem in Maximal Outerplanar Graphs

• Main Authors: Cheng-Chien Chen, 陳政謙
• Other Authors: Yue-Li Wang
• Format: Others
• Language: en_US
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/77956932374884773128

碩士 === 國立臺灣科技大學 === 資訊管理系 === 104 === Given a planar graph G = (V, E), we say that an inner face f of G is kd-visible from a vertex p ∈ V if there is a vertex x in the boundary of f such that dG(x,p) k − 1, where dG(p,x) is the length of a shortest path from p to x. A kd-guarding set of G is a subset S ⊆ V such that every face of G is kd-visible from some vertex in S. In this thesis, we show that finding a minimal 2d-guarding set of a maximal outerplanar graph can be solved in linear time.