The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

Fabrizio Altarelli; Alfredo Braunstein; Luca Dall’Asta; Caterina De Bacco; Silvio Franz

doi:10.1371/journal.pone.0145222

Loading metrics

Open Access

Peer-reviewed

Research Article

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

Fabrizio Altarelli ,

Contributed equally to this work with: Fabrizio Altarelli, Alfredo Braunstein, Luca Dall’Asta, Caterina De Bacco, Silvio Franz

Current address: Capital Fund Management, 23 Rue de l’Université, 75116 Paris, France

Affiliations DISAT and Center for Computational Sciences, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy, Collegio Carlo Alberto, Via Real Collegio 30, 10024 Moncalieri, Italy
⨯
Alfredo Braunstein ,

Contributed equally to this work with: Fabrizio Altarelli, Alfredo Braunstein, Luca Dall’Asta, Caterina De Bacco, Silvio Franz

Affiliations DISAT and Center for Computational Sciences, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy, Collegio Carlo Alberto, Via Real Collegio 30, 10024 Moncalieri, Italy, Human Genetics Foundation, Via Nizza 52, 10126 Torino, Italy
⨯
Luca Dall’Asta ,

Contributed equally to this work with: Fabrizio Altarelli, Alfredo Braunstein, Luca Dall’Asta, Caterina De Bacco, Silvio Franz

Affiliations DISAT and Center for Computational Sciences, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy, Collegio Carlo Alberto, Via Real Collegio 30, 10024 Moncalieri, Italy
⨯
Caterina De Bacco ,

Contributed equally to this work with: Fabrizio Altarelli, Alfredo Braunstein, Luca Dall’Asta, Caterina De Bacco, Silvio Franz

* E-mail: caterina.de-bacco@lptms.u-psud.fr

Affiliation LPTMS, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay, France
⨯
Silvio Franz

Contributed equally to this work with: Fabrizio Altarelli, Alfredo Braunstein, Luca Dall’Asta, Caterina De Bacco, Silvio Franz

Affiliation LPTMS, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay, France
⨯

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

Fabrizio Altarelli,
Alfredo Braunstein,
Luca Dall’Asta,
Caterina De Bacco,
Silvio Franz

Published: December 28, 2015
https://doi.org/10.1371/journal.pone.0145222

Reader Comments (0)

Post a new comment on this article

Subject Areas
?

For more information about PLOS Subject Areas, click here.
We want your feedback. Do these Subject Areas make sense for this article? Click the target next to the incorrect Subject Area and let us know. Thanks for your help!

Graphs
Is the Subject Area "Graphs" applicable to this article?

Thanks for your feedback.
Algorithms
Is the Subject Area "Algorithms" applicable to this article?

Thanks for your feedback.
Random graphs
Is the Subject Area "Random graphs" applicable to this article?

Thanks for your feedback.
Optimization
Is the Subject Area "Optimization" applicable to this article?

Thanks for your feedback.
Polynomials
Is the Subject Area "Polynomials" applicable to this article?

Thanks for your feedback.
Combinatorics
Is the Subject Area "Combinatorics" applicable to this article?

Thanks for your feedback.
Genetic algorithms
Is the Subject Area "Genetic algorithms" applicable to this article?

Thanks for your feedback.
Linear programming
Is the Subject Area "Linear programming" applicable to this article?

Thanks for your feedback.