1434 search results - page 18 / 287 » Graph Searching with Advice |
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
DAM
2008
13 years 8 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
AAAI
2006
13 years 10 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...