268 search results - page 34 / 54 » Finding the k Shortest Paths |
JDA
2008
13 years 7 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
WWW
2010
ACM
13 years 6 months ago
2010
ACM
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patt...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
DM
2010
13 years 7 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...