1172 search results - page 50 / 235 » Path Algorithms on Regular Graphs |
107
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
143
Voted
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
110
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
126
click to vote
SIAMJO
2002
15 years 1 months ago
2002
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
101
Voted
MST
2010
15 years 20 days ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...