Solving the Maximum Edge Disjoint Path Problem Using a Modified Lagrangian Particle Swarm Optimisation Hybrid

2021 ◽  
Author(s):  
Jake Weiner ◽  
Andreas T. Ernst ◽  
Xiaodong Li ◽  
Yuan Sun ◽  
Kalyanmoy Deb
Keyword(s):  
Particle Swarm ◽  
Particle Swarm Optimisation ◽  
Disjoint Path ◽  
Lagrangian Particle ◽  
Edge Disjoint ◽  
Edge Disjoint Path

A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network

2008 ◽  
Author(s):  
Ruen Chze Loh ◽  
Sieteng Soh ◽  
Mihai Lazarescu ◽  
Suresh Rai
Keyword(s):  
Disjoint Path ◽  
Edge Disjoint ◽  
Edge Disjoint Path

scholarly journals Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes

1997 ◽  
Vol 133 (1) ◽  
pp. 1-33 ◽  
Author(s):  
Juraj Hromkovič ◽  
Ralf Klasing ◽  
Walter Unger ◽  
Hubert Wagener
Keyword(s):  
Disjoint Path ◽  
Optimal Algorithms ◽  
Edge Disjoint ◽  
Edge Disjoint Path

Optimal algorithms for broadcast and gossip in the edge-disjoint path modes

1994 ◽  
pp. 219-230 ◽  
Author(s):  
Juraj Hromkovič ◽  
Ralf Klasing ◽  
Walter Unger ◽  
Hubert Wagener
Keyword(s):  
Disjoint Path ◽  
Optimal Algorithms ◽  
Edge Disjoint ◽  
Edge Disjoint Path

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

PLoS ONE ◽  
2015 ◽  
Vol 10 (12) ◽  
pp. e0145222 ◽  
Author(s):  
Fabrizio Altarelli ◽  
Alfredo Braunstein ◽  
Luca Dall’Asta ◽  
Caterina De Bacco ◽  
Silvio Franz
Keyword(s):  
Random Graphs ◽  
Message Passing ◽  
Disjoint Path ◽  
Edge Disjoint ◽  
Edge Disjoint Path
Sign in / Sign up

Export Citation Format

Share Document