697 search results - page 40 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...