98 search results - page 20 / 20 » Finding Regular Simple Paths in Graph Databases |
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
CIKM
2007
Springer
13 years 9 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
BMCBI
2007
13 years 5 months ago
2007
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...