An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs (Q1284699)

From MaRDI portal
Revision as of 18:28, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    26 April 1999
    0 references
    graph algorithm
    0 references
    searchlight guarding problem
    0 references
    dynamic programming
    0 references

    Identifiers