302 search results - page 2 / 61 » Keyword search on external memory data graphs |
IJCAI
2007
13 years 6 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
WINE
2009
Springer
13 years 12 months ago
2009
Springer
It is widely believed that the value of acquiring a slot in a sponsored search list (that comes along with the organic links in a search engine’s result page) highly depends on ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...