268 search results - page 24 / 54 » Finding the k Shortest Paths |
CEC
2005
IEEE
15 years 1 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
SIAMDM
1998
14 years 11 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
MST
2010
14 years 10 months 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...
NAACL
2007
15 years 1 months ago
2007
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
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...