Filters








48,798 Hits in 4.1 sec

A fully dynamic algorithm for distributed shortest paths

Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
2003 Theoretical Computer Science  
We propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights.  ...  Up to now only a result of Ramarao and Venkatesan was known, stating that the problem of updating shortest paths in a dynamic distributed environment is as hard as that of computing shortest paths.  ...  Concluding remarks We have proposed a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights.  ... 
doi:10.1016/s0304-3975(02)00619-9 fatcat:6cqh7hncnrcwhm4rp6ihve3tsi

Recent Advances in Fully Dynamic Graph Algorithms [article]

Kathrin Hanauer, Monika Henzinger, Christian Schulz
2021 arXiv   pre-print
Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.  ...  In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms.  ...  To this end we include fully dynamic algorithms for shortest paths, maximum flows, graph clustering, centrality measures, and graph partitioning.  ... 
arXiv:2102.11169v5 fatcat:tcs3lkgcg5f7jax672adyzrstm

Fully Dynamic Betweenness Centrality [chapter]

Matteo Pontecorvi, Vijaya Ramachandran
2015 Lecture Notes in Computer Science  
For graphs with ν * = O(n), our algorithms match the fully dynamic all pairs shortest paths (APSP) bounds of Demetrescu and Italiano [8] and Thorup [28] for unique shortest paths, where ν * = n − 1.  ...  Our first algorithm also contains within it, a method and analysis for obtaining fully dynamic APSP from a decremental algorithm, that differs from the one in [8] .  ...  Both of our BC algorithms are obtained through fully dynamic all pairs all shortest paths.  ... 
doi:10.1007/978-3-662-48971-0_29 fatcat:yh7hl4aapvgijgcajrvbejnqym

Fully dynamic shortest paths in digraphs with arbitrary arc weights

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
2003 Journal of Algorithms  
Fully Dynamic Shortest Paths in Digraphs with Arbitrary Arc Weights.  ...  Dynamic Shortest Paths • Ahuja, Orlin, Pallottino, and Scutella, Dynamic Shortest Paths Minimizing Travel Times and Costs, Networks, vol. 41, pp.. 197-205, 2003 (previously appeared as TR 01-23, Dipartimento  ... 
doi:10.1016/s0196-6774(03)00082-8 fatcat:bknwmvw3vjhe7hmyyxcbkvqw2e

Dynamic Physarum Solver: a bio-inspired shortest path method of dynamically changing graphs

HİLAL ARSLAN
2019 Turkish Journal of Electrical Engineering and Computer Sciences  
In this paper, we propose a dynamic bio-inspired algorithm for finding the dynamic shortest path for large graphs based on Physarum Solver, which is a shortest path algorithm for static graphs.  ...  The studies in the literature require excessive computational time for computing the dynamic shortest path since determining changing edge weights is difficult especially when the graph size becomes large  ...  King [1] proposed the first fully dynamic algorithm to solve all pairs shortest path problems on directed graphs with positive edge weights.  ... 
doi:10.3906/elk-1811-46 fatcat:4c3tvftlc5bkjkaoaldc6zo6ye

Fully dynamic all-pairs shortest paths with worst-case update-time revisited

Ittai Abraham, Shiri Chechik, Sebastian Krinninger
2017 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms  
We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph.  ...  This is the first improvement for this problem for more than a decade. Conceptually, our algorithm shows that randomization along with a more direct approach can provide better bounds.  ...  Our last ingredient is a reduction for obtaining a fully dynamic algorithm from a decremental algorithm.  ... 
doi:10.1137/1.9781611974782.28 dblp:conf/soda/AbrahamCK17 fatcat:4qvphbqv6zfchjpywqht656h6y

A BRIEF SURVEY ON DISTRIBUTED GRAPH ALGORITHMS FOR SHORTEST DISTANCE

V. Jenifer
2019 Zenodo  
This paper aims to present a brief survey on graph theory based on Shortest Distances in Dynamic Graphs techniques in which the goal is to minimize the amount of work needed to re-optimize the solution  ...  There is an extended history of study in theoretical computer science faithful to designing proficient algorithms for graph problems.  ...  In dynamic all pairs shortest paths, the query DISTANCE(X, Y) can ask for the shortest distance between any pair of vertices X and Y, while in dynamic single source shortest paths, there is a fixed source  ... 
doi:10.5281/zenodo.4301270 fatcat:3p77ciuqgvhgvfmzqueh4vpi4i

Engineering shortest-path algorithms for dynamic networks

Mattia D'Emidio, Daniele Frigioni
2014 Italian Conference on Theoretical Computer Science  
This paper provides a top-level overview of [13] , where new dynamic shortest-path algorithms for various real-world applications are proposed, engineered, analyzed and compared to the literature, both  ...  The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems.  ...  The new approach consists of a new data structure and a new fully dynamic algorithm.  ... 
dblp:conf/ictcs/DEmidioF14 fatcat:icoz7ylnsneabmxj5ikauskdla

A Brief Survey on Distributed Graph Algorithms for Shortest Distance

JENIFER.V
2021 Zenodo  
This paper aims to present a brief survey on graph theory based on Shortest Distances in Dynamic Graphs techniques in which the goal is to minimize the amount of work needed to re-optimize the solution  ...  There is an extended history of study in theoretical computer science faithful to designing proficient algorithms for graph problems.  ...  In dynamic all pairs shortest paths, the query DISTANCE(X, Y) can ask for the shortest distance between any pair of vertices X and Y, while in dynamic single source shortest paths, there is a fixed source  ... 
doi:10.5281/zenodo.4738503 fatcat:jdpvyh3ujbdqpo3ca2kci3ypw4

Intelligent and Predictive Vehicular Networks

Schmidt Shilukobo Chintu, Richard Anthony, Maryam Roshanaei, Constantinos Ierotheou
2014 Intelligent Control and Automation  
We propose algorithms that find multiple shortest paths between an origin and a destination.  ...  Whereas the EBkSP reserves some routes for cars on high priority, our algorithm distributes the benefits of smart routing to all vehicles on the network and serves the road side units such as induction  ...  The section below describes each the three strategies: Dynamic Short Paths (DSP) Dynamic shortest path is viewed as a traditional re-routing strategy that elects the shortest path for vehicles.  ... 
doi:10.4236/ica.2014.52007 fatcat:skjhk2mba5c43ahmhtu23ejlya

Dynamic Shortest Path Algorithms for Hypergraphs

Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-Noy
2015 IEEE/ACM Transactions on Networking  
These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph.  ...  We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes.  ...  To the best of our knowledge, no algorithms exist for the fully dynamic problem in a general hypergraph. In this paper, we develop two fully dynamic shortest path algorithms for general hypergraphs.  ... 
doi:10.1109/tnet.2014.2343914 fatcat:wiimh2cubndsvgvykgbcs225hq

Multicast Tree Diameter for Dynamic Distributed Interactive Applications

K.-H. Vik, P. Halvorsen, C. Griwodz
2008 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications  
Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups.  ...  Our edge-pruning algorithms strongly connect well-placed group nodes to the remaining group members, to create new and pruned group graphs, such that, when a tree algorithm is applied to a pruned group  ...  Shortest-path tree (SPT) [7] is Dijkstra's shortest-path tree algorithm, which is almost exactly the same as Prim's MST. SPT optimizes to find the shortest-path between a source and any target.  ... 
doi:10.1109/infocom.2007.220 fatcat:5bnuzp3msvgwbddshhasylizfa

Multicast Tree Diameter for Dynamic Distributed Interactive Applications

K.-H. Vik, P. Halvorsen, C. Griwodz
2008 IEEE INFOCOM 2008 - The 27th Conference on Computer Communications  
Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups.  ...  Our edge-pruning algorithms strongly connect well-placed group nodes to the remaining group members, to create new and pruned group graphs, such that, when a tree algorithm is applied to a pruned group  ...  Shortest-path tree (SPT) [7] is Dijkstra's shortest-path tree algorithm, which is almost exactly the same as Prim's MST. SPT optimizes to find the shortest-path between a source and any target.  ... 
doi:10.1109/infocom.2008.220 dblp:conf/infocom/VikHG08 fatcat:vnxand6hh5as5cmzyo2da7qcxm

A Survey of Shortest-Path Algorithms [article]

Amgad Madkour, Walid G. Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, Saleh Basalamah
2017 arXiv   pre-print
Other important dimensions of the taxonomy include whether the shortest-path algorithm operates over a static or a dynamic graph, whether the shortest-path algorithm produces exact or approximate answers  ...  A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph.  ...  The survey tackles two important questions, namely whether dynamic shortest-paths achieve a space complexity of O(n 2 ), and whether single-source shortest path algorithms in a fully-dynamic setting be  ... 
arXiv:1705.02044v1 fatcat:fkh55mi34vezhbvjbzu7ekmdai

Book announcements

1992 Discrete Applied Mathematics  
Single-source shortest paths in directed acyclic graphs 536. Difference constraints and shortest paths. Chapter 26: A/l-Pairs Shortest Paths. Shortest paths and matrix multiplication.  ...  Growing a minimum spanning tree. The algorithms of Kruskal and Prim. Chapter 25: Single-Source Shortest Paths. Shortest paths and relaxation. Dijkstra's algorithm. The Bellman-Ford algorithm.  ... 
doi:10.1016/0166-218x(92)90042-9 fatcat:tmyols4labfmpb2xgcevnbkl6y
« Previous Showing results 1 — 15 out of 48,798 results