27 search results - page 1 / 6 » Engineering Label-Constrained Shortest-Path Algorithms |
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
WEA
2004
Springer
14 years 2 months ago
2004
Springer
JDA
2006
13 years 9 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
IEEEPACT
2006
IEEE
14 years 3 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
FSTTCS
2010
Springer
13 years 6 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...