The following pages link to Interval graphs and searching (Q1059088):
Displaying 8 items.
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- (Q5874536) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- A cops and robber game and the meeting time of synchronous directed walks (Q6599064) (← links)