scientific article; zbMATH DE number 4053685

From MaRDI portal
Publication:3789614





[For the entire collection see Zbl 0608.00016.] For a graph \(G=(V,E)\), a locating dominating set, herein called a beacon set, is a subset B of V with the following properties: (i) every vertex in V-B has at least one neighbour in B, and (ii) for every pair of vertices u,v\(\in V-B\), N(u)\(\cap B\neq N(v)\cap B\), where N(x) is the set of vertices adjacent to vertex x in G. In this paper, we show that the problem of determining whether or not a graph has a beacon set of size k is NP-complete and, in contrast, we present a linear time dynamic programming algorithm for the problem restricted to series parallel graphs.




Cited in
(67)








This page was built for publication:

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