Distributed Landmark Selection for Lower Bound Estimation of Distances in Large Graphs.

Mingdao Li Peng Peng Yang Xu Hao Xia Zheng Qin

Published in: APWeb/WAIM (1) (2019)

Keyphrases

lower bound
upper bound
cooperative
multi agent
distributed environment
selection criterion
branch and bound algorithm
branch and bound

polynomial approximation
lower and upper bounds
graph mining
graph matching
directed graph
distance measure
optimal solution
distributed systems

worst case
np hard
mobile agents
euclidean distance
parameter estimation
distance function
bipartite graph
similarity measure

accurate estimation
graph theoretic
undirected graph
communication cost
graph structure
peer to peer
model selection