Results 11 to 20 of about 47,764 (259)
Performance of shortest path algorithm based on parallel vertex traversal [PDF]
Serbian Journal of Electrical Engineering, 2016 Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of ...
Vesović Mihailo +2 more
doaj +1 more source
Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies
IEEE Access, 2021 A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed.
Oleg G. Monakhov +4 more
doaj +1 more source
A neural network for shortest path computation [PDF]
IEEE Transactions on Neural Networks, 2001 This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem.
Filipe Araújo +2 more
openaire +3 more sources
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network [PDF]
EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 2017 The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph.
Chien Tran Quoc, Hung Ho Van
doaj +1 more source
Shortest shortest path trees of a network
Discrete Applied Mathematics, 1996 If \(N\) is an undirected network where each edge has positive length, we may consider the distances of vertices from a specified internal point of an edge. A shortest path tree (SPT) rooted at \(s\) (possibly an internal point of an edge) is a spanning tree \(T\) of the network \(N[s]\) (i.e., \(N\) with \(s\) as possibly a new vertex) where for each ...
Pierre Hansen, Maolin Zheng
openaire +1 more source
Shortest path counting in probabilistic biological networks
BMC Bioinformatics, 2018 Background Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell.
Yuanfang Ren, Ahmet Ay, Tamer Kahveci
doaj +1 more source
A speedup technique for dynamic graphs using partitioning strategy and multithreaded approach
Journal of King Saud University: Computer and Information Sciences, 2014 There are many pre-processing-based speedup techniques for shortest path problems that are available in the literature. These techniques have an increased demand because of large datasets in such applications such as roadmaps, web search engines and ...
R. Kalpana, P. Thambidurai
doaj +1 more source
Scientific Reports, 2023 Betweenness centrality is one of the key measures of the node importance in a network. However, it is computationally intractable to calculate the exact betweenness centrality of nodes in large-scale networks.
Nan Xiang, Qilin Wang, Mingwei You
doaj +1 more source
Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks
Information, 2022 The most common problem on routing networks is to compute the shortest paths from a source vertex to a set of target vertices. A variation of it, with applications for recommender systems, asks to merely rank the target vertices with respect to the ...
Dominik Köppl
doaj +1 more source
INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019 The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj +1 more source