Depth-Robust Graphs and Their Cumulative Memory Complexity.

Joël Alwen Jeremiah Blocki Krzysztof Pietrzak

Published in: EUROCRYPT (3) (2017)

Keyphrases

memory requirements
graph matching
pruning power
database
computationally efficient
graph theory
data sets
high quality
knn
d objects
worst case
np complete
stereo matching
graph representation
memory usage
memory space