Login / Signup
A New Approach to Obtain EFMs Using Graph Methods Based on the Shortest Path between End Nodes.
Jose Francisco Hidalgo Céspedes
Francisco De Asís Guil Asensio
José Manuel García Carrasco
Published in:
IWBBIO (1) (2015)
Keyphrases
</>
shortest path
weighted graph
shortest path problem
path length
flow graph
edge weights
graph structure
road network
travel time
optimal path
minimum spanning tree
real world networks
spanning tree
nearest neighbor
graph search
shortest path algorithm
betweenness centrality
finding the shortest path