Shortest Path Computing in Directed Graphs with Weighted Edges Mapped on Random Networks of Memristors.
Carlos FernandezIoannis VourkasAntonio RubioPublished in: Parallel Process. Lett. (2020)
Keyphrases
- directed graph
- edge weights
- shortest path
- shortest path problem
- source node
- betweenness centrality
- directed edges
- weighted graph
- random walk
- path length
- directed acyclic graph
- undirected graph
- graph structure
- maximum flow
- graph structures
- minimum spanning tree
- path selection
- disjoint paths
- road network
- shortest distance
- search space
- travel time
- strongly connected
- optimal path
- social networks