2294 search results - page 39 / 459 » From Path Graphs to Directed Path Graphs |
172
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
175
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
165
click to vote
SCAM
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we first present a static analysis based on set-based framework, which estimates exception propagation paths of Java programs. We construct an exception propagatio...
170
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
161
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...