… In this article, we design data structures to maintain a weighted tree on nnodes such that we
… path queries. We consider path counting, path reporting, path median, and path selection …

… , path queries replace the simpler associative queries. Several data structures have been
proposed for answering path … latter case we will refer to the query by giving only the query path. …

… In this paper, we design succinct data structures to maintain a weighted tree T such that we
… path queries. We consider path counting, path reporting, path median, and path selection …

… In addition, we present a data structure that answers path reporting queries … data structures
to maintain a weighted tree T on n nodes such that we can support the following path queries…

… Our data structures, which use tree extraction, heavy-path … Our succinct data structures are
further specialized to be … , we show that succinct data structures for path queries may present a …

… We present results related to satisfying shortest path queries … external memory so that
bottom-up paths can be traversed I/O-… data structure that allows for answering shortest path …

… algorithm is allowed to return an approximate shortest path, the worst-case accuracy (often …
-path query processing method raises questions such as: How can these data structures be …

… data structure that allows to preprocess a. rectilinear polygon with n vertices such that, for any
two query points, the shortest path … of the shortest path. If only the distance is of interest, the …

… However, it must be stressed that these formalisms preserve nei- ther structure nor order of
a database instance; they are intended as auxiliary data structures for query opt- mization. In …

… data structure for answering shortest path queries inside a simple polygon. The new data
structure has the same asymptotic performance as the previously known data structure (linear …