Pages that link to "Item:Q1273613"
From MaRDI portal
The following pages link to An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613):
Displaying 8 items.
- Edge monitoring problem on interval graphs (Q510622) (← links)
- Incremental assignment problem (Q865928) (← links)
- The interval-merging problem (Q867634) (← links)
- An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs (Q1284699) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
- The searchlight guarding problem on weighted split graphs and weighted cographs (Q4488859) (← links)
- Vertex-edge domination in graphs (Q5919557) (← links)