Pages that link to "Item:Q2429351"
From MaRDI portal
The following pages link to A distributed algorithm for computing the node search number in trees (Q2429351):
Displaying 6 items.
- On the monotonicity of process number (Q299059) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Distributed search trees: fault tolerance in an asynchronous environment (Q1762993) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)