An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
type: Item
instance of: scholarly article
title: An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
zbMATH Open document ID: 0915.68134
DOI: 10.1016/S0020-0255(96)00268-X
author: K. Appert
published in: Information Sciences
publication date: 1999-01-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1235223
zbMATH Keywords: searchlight guarding problem
MaRDI profile type: Publication
cites work: Q3292915
cites work: A characterisation of rigid circuit graphs
cites work: Q3619797
cites work: Q4193514
cites work: Incidence matrices and interval graphs
cites work: `` Strong '' NP-Completeness Results
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q3328583
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
cites work: Scheduling to Minimize Interaction Cost
cites work: A unified approach to domination problems on interval graphs
cites work: Linear algorithm for optimal path cover problem on interval graphs
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
full work available at URL: s0020-0255(96)00268-x
OpenAlex ID: W1992925192
description: scientific article; zbMATH DE number 1235223