An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs (Q1284699): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002360050156 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006861874 / rank | |||
Normal rank | |||
Revision as of 18:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs |
scientific article |
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
