From Color-Avoiding to Color-Favored Percolation in Diluted Lattices
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 regular (mainly directed) lattices with a fra...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2020-08-01
|
| Saila: | Future Internet |
| Gaiak: | |
| Sarrera elektronikoa: | https://www.mdpi.com/1999-5903/12/8/139 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|