Cargando…
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic o...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2015
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4699204/ https://www.ncbi.nlm.nih.gov/pubmed/26710102 http://dx.doi.org/10.1371/journal.pone.0145222 |