Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
We propose an indexing scheme for efficient graph query processing. We introduce a decomposition algorithm which works for all graphs. We design query answering algorithms for shortest path and kNN.
shortest path graphs algorithms graph indexing tree decomposition k nearest neighbors problems