Filters








11,993 Hits in 5.8 sec

A forward-backward single-source shortest paths algorithm [article]

David B. Wilson, Uri Zwick
2014 arXiv   pre-print
We describe a new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms.  ...  As a consequence, we also get a new all-pairs shortest paths algorithm.  ...  The forward-backward single-source shortest paths algorithm correctly finds a tree of shortest paths. Proof. Let s = w 0 , w 1 , . . . , w k = v be a shortest path from the source s to a vertex v.  ... 
arXiv:1405.7619v1 fatcat:7l766ppjirhvjoqtjddittgzme

A Forward-Backward Single-Source Shortest Paths Algorithm

David B. Wilson, Uri Zwick
2015 SIAM journal on computing (Print)  
We describe a new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms.  ...  As a consequence, we also get a new all-pairs shortest paths algorithm.  ...  Concluding remarks and open problems We presented a new forward-backward single-source shortest paths algorithm that demonstrates the usefulness of backward scans.  ... 
doi:10.1137/140970975 fatcat:e4n5q5gvhjfk7aqhwabrybwvqy

A Forward-Backward Single-Source Shortest Paths Algorithm

David B. Wilson, Uri Zwick
2013 2013 IEEE 54th Annual Symposium on Foundations of Computer Science  
We describe a new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms.  ...  As a consequence, we also get a new all-pairs shortest paths algorithm.  ...  Concluding remarks and open problems We presented a new forward-backward single-source shortest paths algorithm that demonstrates the usefulness of backward scans.  ... 
doi:10.1109/focs.2013.81 dblp:conf/focs/WilsonZ13 fatcat:lp2u6jz4ujd4fehmghbiq7k7fy

Fast bidirectional shortest path on GPU

Lalinthip Tangjittaweechai, Mongkol Ekpanyapong, Thaisiri Watewai, Krit Athikulwongse, Sung Kyu Lim, Adriano Tavares
2016 IEICE Electronics Express  
We achieve substantial speedup over a parallel method that performs a single parallel search on the GPGPU from the source to all other nodes but early terminates when the shortest path to the specified  ...  We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units.  ...  Each node in P has both a forward and a backward shortest path cost. Each update for a node in P computes the sum of the forward shortest path cost and the backward shortest path cost to that node.  ... 
doi:10.1587/elex.13.20160036 fatcat:pewuiuogdnbafel4iec3rr7sqy

Efficient PCE-based survivable Path Computation in multi-domain networks

Qiong Zhang, M. Masud Hasan, Xi Wang, Paparao Palacharla, Motoyoshi Sekiya
2011 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)  
We propose a novel PCE-based scheme that computes the shortest path over multiple domains in the forward direction and computes the disjoint path in the backward direction.  ...  We consider the problem of finding end-toend shortest disjoint paths for a given sequence of domains in multi-domain networks.  ...  VSPT-forward contains shortest paths from the source to each egress border node.  ... 
doi:10.1109/infcomw.2011.5928795 fatcat:w6rgz6hhhndaniopzxyignkeuu

Optimal Path Solution Using Dijkstra's Algorithm for Practical 21 bus system

K.Venkat Rao and Dr.K.RamaSudha
2021 International journal of modern trends in science and technology  
This paper presents the Shortest Path Finding algorithm to identify the optimal path for a distribution system during restoration using Dijkstra's method.  ...  The power losses of the distribution system are calculated using Forward-Backward sweep load flow method.  ...  To find the shortest path in the weighted network, the following SPF algorithms are used.  Dijkstra's algorithm solves the single-pair, single-source, and single-destination shortest path problems.   ... 
doi:10.46501/ijmtst061296 fatcat:xaax3ilj6ne6tcnjn2ttw3jz24

Computation of Pheromone Values in AntNet Algorithm

Anuj K. Gupta, Harsh Sadawarti, Anil K. Verma
2012 International Journal of Computer Network and Information Security  
Also the optimal paths can then be computed based on the shortest cumulative pheromone count between source and destination nodes.  ...  On the basis of these tables we have tried to compute the shortest and most optimal path between source node and destination node.  ...  When the forward ant reaches its final destination, the path based on Dijkstra algorithm is computed and he forward ant is transformed into a backward ant.  ... 
doi:10.5815/ijcnis.2012.09.06 fatcat:uuwsgpfwrfc4tgm52ptwcdecfu

Performance analysis of the AntNet algorithm

S.S. Dhillon, P. Van Mieghem
2007 Computer Networks  
In this paper, we compare the performance of AntNet, an ant-routing algorithm, with Dijkstra's shortest path algorithm.  ...  Our simulations show that the performance of AntNet is comparable to Dijkstra's shortest path algorithm.  ...  Thus, only one out of N À 1 forward ants is used to search for the shortest path between a given source and destination.  ... 
doi:10.1016/j.comnet.2006.11.002 fatcat:o34erfafqngtznlxfnxaiomm3u

A Fine-Grained Hybrid CPU-GPU Algorithm for Betweenness Centrality Computations [article]

Ashirbad Mishra, Sathish Vadhiyar, Rupesh Nasre, Keshav Pingali
2020 arXiv   pre-print
The forward phase in our hybrid BC algorithm leverages the multi-source property inherent in the BC problem.  ...  We also perform a novel hybrid and asynchronous backward phase that performs minimal CPU-GPU synchronizations.  ...  For each node of the graph, the algorithm consists of a forward phase that finds the shortest path between the node as a source and the other nodes using BFS or SSSP, and a backward phase that computes  ... 
arXiv:2008.05718v1 fatcat:o52zlf3shre6tkpmglez222jae

Solving shortest paths efficiently on nearly acyclic directed graphs

Shane Saunders, Tadao Takaoka
2007 Theoretical Computer Science  
In this framework, a specialised shortest path algorithm only spends delete-min operations on trigger vertices, thereby making the computation of shortest paths through non-trigger vertices easier.  ...  Shortest path problems can be solved very efficiently when a directed graph is nearly acyclic.  ...  The single-source shortest path problem, with a single initial distance of d[s] = 0, is a special case of a more general situation.  ... 
doi:10.1016/j.tcs.2006.10.008 fatcat:wigeeq6eovferchgjtz3c54axm

Computing Many-to-Many Shortest Paths Using Highway Hierarchies [chapter]

Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
2007 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)  
We present a fast algorithm for computing all shortest paths between source nodes s ∈ S and target nodes t ∈ T .  ...  Our approach is based on highway hierarchies, which are also used for the currently fastest speedup techniques for shortest path queries in road networks.  ...  We can find all required paths by doing |S| single source shortest path computations.  ... 
doi:10.1137/1.9781611972870.4 dblp:conf/alenex/KnoppSSSW07 fatcat:c2byvgouurfvfcudtrnecjjryy

Fast Detour Computation for Ride Sharing

Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Volker, Marc Herbstritt
2010 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
We solve this interesting problem by presenting a fast algorithm that computes the offers with the smallest detours w.r.t. a request.  ...  Today's ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search.  ...  paths from forward and backward search.  ... 
doi:10.4230/oasics.atmos.2010.88 dblp:conf/atmos/GeisbergerLNSV10 fatcat:ztpudg7xqffofcs54for2463mq

An enhanced routing algorithm using ant colony optimization and VANET infrastructure

Noussaiba Melaouene, Rahal Romadi, R. Montemanni
2019 MATEC Web of Conferences  
This paper proposes an enhanced algorithm, based on ACO Ant Colony Optimization and related to VANET infrastructure that aims to find the shortest path from the source to destination through the optimal  ...  In the transportation field, finding the shortest path in a road network is a common problem.  ...  Each forward ant keeps a list of the intersections it has visited. The path establishment Upon arrival at the destination D, the forward ant is converted into a backward ant.  ... 
doi:10.1051/matecconf/201925902009 fatcat:f3xj5qyttraifffiji3r2haone

Fast Detour Computation for Ride Sharing [article]

Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Volker
2009 arXiv   pre-print
We solve this interesting problem by presenting a fast algorithm that computes the offers with the smallest detours w.r.t. a request.  ...  Todays ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search.  ...  paths from forward and backward search.  ... 
arXiv:0907.5269v1 fatcat:l5ttalugfzar3e6244bmdfbztm

Developing Efficient Implementations of Bellman–Ford and Forward-Backward Graph Algorithms for NEC SX-ACE

2018 Supercomputing Frontiers and Innovations  
In this paper we describe possible implementations of two fundamental graph-processing algorithms for an NEC SX-ACE vector computer: the Bellman-Ford algorithm for single source shortest paths computation  ...  and the Forward-Backward algorithm for strongly connected components detection.  ...  graph processing problems for a NEC SX-ACE computer: single source shortest paths computation and strongly connected components search.  ... 
doi:10.14529/jsfi180311 fatcat:wnkdurjru5fazj6srziu7ftz7e
« Previous Showing results 1 — 15 out of 11,993 results