I/O-efficient algorithms for top-k nearest keyword search in massive graphs

Networks emerging nowadays usually have labels or textual content on the nodes. We model such commonly seen network as an undirected graph G, in which each node is attached with zero or more keywor...