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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	PloS one 2015-12, Vol.10 (12), p.e0145222-e0145222
Hauptverfasser:	Altarelli, Fabrizio, Braunstein, Alfredo, Dall'Asta, Luca, De Bacco, Caterina, Franz, Silvio
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analysis Applied mathematics Artificial Intelligence Automobiles Benchmarks Communication Communications networks Computer Communication Networks Computer Graphics Computer Simulation Convergence Equations (Mathematics) Graph coloring Graphic methods Graphs Linear programming Mathematical models Message passing Numerical simulations Optimization Physics Problems Routing Statistical mechanics Theory Traffic control Travel
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!