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

DOI10.1007/S002360050156MaRDI QIDQ1284699zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Publication:4488859
• An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
• The searchlight problem for road networks
• Connected searching of weighted trees

Cited in

(4)

• An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
• Dominating vertex covers: the vertex-edge domination problem
• The searchlight problem for road networks
• scientific article; zbMATH DE number 1471731 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284699)