An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
From MaRDI portal
Publication:1273613
DOI10.1016/S0020-0255(96)00268-XzbMath0915.68134OpenAlexW1992925192MaRDI QIDQ1273613
Publication date: 3 January 1999
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(96)00268-x
Related Items (6)
Incremental assignment problem ⋮ The interval-merging problem ⋮ Unnamed Item ⋮ Vertex-edge domination in graphs ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ The searchlight problem for road networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear algorithm for optimal path cover problem on interval graphs
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
- A unified approach to domination problems on interval graphs
- A characterisation of rigid circuit graphs
- Incidence matrices and interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Algorithmic Aspects of Vertex Elimination on Graphs
- `` Strong NP-Completeness Results
- Scheduling to Minimize Interaction Cost
This page was built for publication: An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
