Single-Source Shortest Path Tree for Big Dynamic Graphs

2018 ◽  
Author(s):  
Sara Riazi ◽  
Sriram Srinivasan ◽  
Sajal K. Das ◽  
Sanjukta Bhowmick ◽  
Boyana Norris
Keyword(s):  
Shortest Path ◽  
Single Source ◽  
Dynamic Graphs ◽  
Shortest Path Tree

Shortest Path Tree Computation in Dynamic Graphs

2009 ◽  
Vol 58 (4) ◽  
pp. 541-557 ◽  
Author(s):  
E.P.F. Chan ◽  
Yaya Yang
Keyword(s):  
Shortest Path ◽  
Dynamic Graphs ◽  
Shortest Path Tree

scholarly journals SISTEM PENDUKUNG KEPUTUSAN OTOMATISASI PLANNING WISATA BERBASIS WEBSITE DENGAN MENGGUNAKAN METODE DIJKSTRA

Compiler ◽  
2013 ◽  
Vol 2 (1) ◽  
Author(s):  
Eko Suryanto ◽  
Anton Setiawan Honggowibowo ◽  
Nurcahyani Dewi Retnowati
Keyword(s):  
Shortest Path ◽  
Search Algorithm ◽  
Graph Search ◽  
Single Source ◽  
Application Development ◽  
Tourism Planning ◽  
Shortest Path Tree

The application development of website that have a good progress from Website is very important in tourism field where website can promote the interesting and unique of tourism place for tourist. In tourism field website can be important if completed with superriority is tourism planning where tourist can plan their holidays effective and efficient. Dijkstra method is a graph search algorithm is used to solve the problem with a single source shortest path on a graph that produces a shortest path tree. The usage of dijkstra method in decision the tourism planning base website is appropriate because used to plan the holidays based on the route or the sorthest way that has been found by latitude and longitude counting which is very important to decide range from each place, so it can help the tourist.

scholarly journals An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs

2017 ◽  
Vol 405 ◽  
pp. 123-140 ◽  
Author(s):  
Xiaoge Zhang ◽  
Felix T.S. Chan ◽  
Hai Yang ◽  
Yong Deng
Keyword(s):  
Shortest Path ◽  
Dynamic Graphs ◽  
Shortest Path Tree

scholarly journals A novel genetic algorithm for solving the clustered shortest-path tree problem

2020 ◽  
Vol 36 (3) ◽  
pp. 401-414
Author(s):  
OVIDIU COSMA ◽  
PETRICA C. POP ◽  
IOANA ZELINA
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Spanning Tree ◽  
The Other ◽  
Computational Results ◽  
Single Source ◽  
High Quality ◽  
Shortest Path Tree ◽  
Solution Approach ◽  
Benchmark Instances

The clustered shortest-path tree problem is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes divided into a redefined, mutually exclusive and exhaustive set of clusters, we want to determine a shortest-path spanning tree from a given source to all the other nodes of the graph, with the property that each cluster should induce a connected subtree. The investigated problem proved to be NP-hard and therefore we proposed an efficient genetic algorithm in order to solve it. The preliminary computational results reported on a set of benchmark instances from the literature proved that our proposed solution approach yields high-quality solutions within reasonable running times.

scholarly journals A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization

2021 ◽  
Vol 100 ◽  
pp. 104187 ◽  
Author(s):  
Huynh Thi Thanh Binh ◽  
Ta Bao Thang ◽  
Nguyen Duc Thai ◽  
Pham Dinh Thanh
Keyword(s):  
Shortest Path ◽  
Shortest Path Tree ◽  
Encoding Scheme
Sign in / Sign up

Export Citation Format

Share Document