There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
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...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...