21 search results - page 3 / 5 » Fast and accurate estimation of shortest paths in large grap... |
ALGORITHMICA
2011
13 years 10 days ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
ICPP
2006
IEEE
13 years 11 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
SSDBM
2005
IEEE
13 years 11 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The common utilization-based definition of available bandwidth and many of the existing tools to estimate it suffer from several important weaknesses: i) most tools report a point...