Pages that link to "Item:Q2377133"
From MaRDI portal
The following pages link to The cost of monotonicity in distributed graph searching (Q2377133):
Displayed 12 items.
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Connected graph searching (Q690489) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Throttling processes equivalent to full throttling on trees (Q2661773) (← links)
- Network Decontamination with Temporal Immunity by Cellular Automata (Q4931220) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)