|
|
|
Michele Giusfredi and Franco Bagnoli
We study the problem of color-avoiding and color-favored percolation in a network, i.e., the problem of finding a path that avoids a certain number of colors, associated with vulnerabilities of nodes or links, or is attracted by them. We investigate here...
ver más
|
|
|