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...

Full description

Bibliographic Details

Main Author:	Rosenstock Cukrowicz, Nicole (author)
Format:	masterThesis
Language:	Spanish
Published:	2018
Subjects:	Optimización combinatoria Nodos críticos GRASP Complejidad computacional Path Relinking COMPLEJIDAD COMPUTACIONAL
Online Access:	https://hdl.handle.net/20.500.12008/22384
Tags:	Add Tag No Tags, Be the first to tag this record!