Pages that link to "Item:Q2344776"
From MaRDI portal
The following pages link to Non-deterministic graph searching in trees (Q2344776):
Displaying 5 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Unbounded search and recursive graph problems (Q5096341) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)