697 search results - page 40 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
246
click to vote
VLDB
2007
ACM
16 years 5 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...
130
click to vote
WEA
2007
Springer
15 years 11 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...
192
click to vote
SPIRE
2005
Springer
15 years 10 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...
164
Voted
ICDM
2010
IEEE
15 years 3 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...
143
Voted
PODS
2006
ACM
16 years 5 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...