The edge-disjoint path problem on random graphs by message-passing.
Fabrizio AltarelliAlfredo BraunsteinLuca Dall'AstaCaterina De BaccoSilvio FranzPublished in: CoRR (2015)
Keyphrases
- message passing
- random graphs
- edge disjoint
- spanning tree
- undirected graph
- belief propagation
- graph theoretic
- minimum cost
- total length
- distributed systems
- phase transition
- distributed shared memory
- learning curves
- shared memory
- inference in graphical models
- factor graphs
- graphical models
- power law
- small world
- markov random field
- sum product
- approximate inference
- sum product algorithm
- image matching
- reinforcement learning
- high quality