An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs (Q1284699)
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 1279212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs |
scientific article; zbMATH DE number 1279212 |
Statements
An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs (English)
0 references
26 April 1999
0 references
graph algorithm
0 references
searchlight guarding problem
0 references
dynamic programming
0 references
0.9162596464157104
0 references
0.7488309144973755
0 references
0.7433542013168335
0 references
