Pages that link to "Item:Q930888"
From MaRDI portal
The following pages link to Monotonicity of non-deterministic graph searching (Q930888):
Displaying 7 items.
- On the monotonicity of process number (Q299059) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Edge search number of cographs (Q415273) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
