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

DOI10.1007/s002360050156zbMath0927.68069OpenAlexW2006861874MaRDI QIDQ1284699

K. Appert

Publication date: 26 April 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050156

zbMATH Keywords

dynamic programminggraph algorithmsearchlight guarding problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Unnamed Item ⋮ Dominating vertex covers: the vertex-edge domination problem ⋮ The searchlight problem for road networks

This page was built for publication: An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs