Hardness and approximation results for Black Hole Search in arbitrary networks.
Ralf KlasingEuripides MarkouTomasz RadzikFabiano SarraccoPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- black hole search
- mobile agents
- network topologies
- black hole
- cooperative
- social networks
- computational complexity
- complex networks
- worst case
- network analysis
- network design
- neural network
- np hard
- multi agent
- closed form
- error bounds
- agnostic learning
- heterogeneous networks
- approximation algorithms
- computer networks
- network structure
- information theoretic
- intelligent agents