More agents may decrease global work: a case in butterfly decontamination
From MaRDI portal
Publication:343925
DOI10.1016/j.tcs.2016.09.027zbMath1353.68214OpenAlexW2532280670MaRDI QIDQ343925
Publication date: 29 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.027
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight bounds for black hole search with scattered agents in synchronous rings
- More efficient periodic traversal in anonymous undirected graphs
- Connected graph searching
- Network decontamination under \(m\)-immunity
- An annotated bibliography on guaranteed graph searching
- Distributed chasing of network intruders
- Setting port numbers for fast graph exploration
- Capturing an intruder in product networks
- Graph searching with advice
- Two edge-disjoint hamiltonian cycles in the butterfly graph
- Local majorities, coalitions and monopolies in graphs: A review
- The cost of monotonicity in distributed graph searching
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Decontamination of hypercubes by mobile agents
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- Approximation bounds for Black Hole Search problems
- The complexity of searching a graph
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: More agents may decrease global work: a case in butterfly decontamination