GRASP Heuristics for the stochastic weighted graph fragmentation problem
Critical nodes play a major role in network connectivity. Identifying them is important to design efficient strategies to prevent malware or epidemics spread through a network. In this context, the Stochastic Weighted Graph Fragmentation Problem (SWGFP) is a combinatorial optimization problem that b...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | masterThesis |
| Langue: | espagnol |
| Publié: |
2018
|
| Sujets: | |
| Accès en ligne: | https://hdl.handle.net/20.500.12008/22384 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires: GRASP Heuristics for the stochastic weighted graph fragmentation problem
- Análisis y estudio de complejidad del problema de fragmentación de grafos
- Propiedades y métodos de cálculo de la confiabilidad diámetro-acotada en redes
- Motor genético :Generic genetic engine - GGEngine 1.0 (versión Serial 1.0)
- GRASP heuristics for Wide Area Network design
- La interactividad en ambientes multirreferenciales de aprendizaje
- Project Management: an exploratory study