No label defined (Q3789614)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4053685 |
Statements
1987
0 references
locating dominating set
0 references
beacon set
0 references
algorithm
0 references
series parallel graphs
0 references
0.7918655872344971
0 references
[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.
0 references