Sciweavers

294 search results - page 32 / 59
» Answering Regular Path Queries Using Views
Sort
View
CONCURRENCY
2008
127views more  CONCURRENCY 2008»
13 years 11 months ago
gLite Job Provenance - a job-centric view
ct Job Provenance (JP) is a Grid service that keeps long-term trace on completed computations for further reference. It is a job-centric service, keeping records about job life cyc...
Ales Krenek, Jirí Sitera, Ludek Matyska, Fr...
JCDCG
2004
Springer
14 years 4 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
COCOON
2001
Springer
14 years 3 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
CIKM
2010
Springer
13 years 9 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 11 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen