Bounded-degree light approximate shortest-path trees in doubling metrics

2021 ◽  
Vol 305 ◽  
pp. 199-204
Author(s):  
Joachim Gudmundsson ◽  
Julián Mestre ◽  
Seeun William Umboh
Keyword(s):  
Shortest Path ◽  
Bounded Degree ◽  
Doubling Metrics ◽  
Shortest Path Trees ◽  
Approximate Shortest Path

scholarly journals Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

Algorithmica ◽  
2021 ◽  
Author(s):  
Davide Bilò ◽  
Luciano Gualà ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Fault Tolerant ◽  
Multiple Edge ◽  
Shortest Path Trees ◽  
Approximate Shortest Path

scholarly journals Fault-Tolerant Approximate Shortest-Path Trees

Algorithmica ◽  
2017 ◽  
Vol 80 (12) ◽  
pp. 3437-3460
Author(s):  
Davide Bilò ◽  
Luciano Gualà ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Fault Tolerant ◽  
Shortest Path Trees ◽  
Approximate Shortest Path

scholarly journals Path-Fault-Tolerant Approximate Shortest-Path Trees

2015 ◽  
pp. 224-238 ◽  
Author(s):  
Annalisa D’Andrea ◽  
Mattia D’Emidio ◽  
Daniele Frigioni ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Fault Tolerant ◽  
Shortest Path Trees ◽  
Approximate Shortest Path

scholarly journals Fault-Tolerant Approximate Shortest-Path Trees

2014 ◽  
pp. 137-148 ◽  
Author(s):  
Davide Bilò ◽  
Luciano Gualà ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Fault Tolerant ◽  
Shortest Path Trees ◽  
Approximate Shortest Path

Dynamically Maintaining Shortest Path Trees under Batches of Updates

2013 ◽  
pp. 286-297 ◽  
Author(s):  
Annalisa D’Andrea ◽  
Mattia D’Emidio ◽  
Daniele Frigioni ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Shortest Path Trees

Recognizing shortest-path trees in linear time

1994 ◽  
Vol 52 (2) ◽  
pp. 77-85 ◽  
Author(s):  
C.H. Peng ◽  
J.S. Wang ◽  
R.C.T. Lee
Keyword(s):  
Shortest Path ◽  
Linear Time ◽  
Shortest Path Trees
Sign in / Sign up

Export Citation Format

Share Document