Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...