Searching for a Black Hole in a Dynamic Cactus
In this paper, we study the problem of black hole search by a team of mobile agents. A black hole is a dangerous stationary node in a graph that eliminates any visiting agent without leaving any trace of its existence. Key parameters that dictate the complexity of finding the black hole include the...
Saved in:
| Published in: | Journal of graph algorithms and applications Vol. 29; no. 2; pp. 127 - 166 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
20.05.2025
|
| ISSN: | 1526-1719, 1526-1719 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!