-Based Routing Graphs in Large Unconstrained Spaces.

F. Taia Alaoui David Bétaille Valérie Renaudin

Published in: Wirel. Commun. Mob. Comput. (2017)

Keyphrases

real time
graph matching
graph theoretic
bipartite graph
graph model
graph representation
directed graph
wireless ad hoc networks
graph structure
network topology
weighted graph
series parallel
network topologies
graph clustering
graph data
routing problem
graph theory
ad hoc networks
end to end
shortest path