1161 search results - page 4 / 233 » Kinetic Dependence Graphs |
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
CPHYSICS
2006
13 years 6 months ago
2006
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
POPL
1991
ACM
13 years 9 months ago
1991
ACM
VISSOFT
2005
IEEE
13 years 11 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...