Pages that link to "Item:Q930899"
From MaRDI portal
The following pages link to Distributed chasing of network intruders (Q930899):
Displaying 11 items.
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Connected graph searching (Q690489) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents (Q5100962) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)
