Login / Signup
Accelerating breadth-first graph search on a single server by dynamic edge trimming.
Guangyan Zhang
Shu-han Cheng
Jiwu Shu
Qingda Hu
Weimin Zheng
Published in:
J. Parallel Distributed Comput. (2018)
Keyphrases
</>
graph search
single server
retrial queue
search algorithm
memory efficient
heuristic search
queueing networks
priority scheduling
parallel machines
duplicate detection
depth first search
special case
queue length
graph databases
search strategies
np hard
search space