13 search results - page 1 / 3 » Planar graphs, negative weight edges, shortest paths, and ne... |
61
Voted
JCSS
2006
14 years 11 months ago
2006
108
click to vote
SIAMCOMP
1998
14 years 11 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)...
123
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
100
click to vote
STOC
2009
ACM
16 years 10 days ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
100
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...