Enrico Nardelli

Learn More
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed <i>moving objects databases</i>. We formally define a data model for such databases that includes complex evolving spatial structures such as line networks or multi-component regions with holes. The data model is given as a collection of(More)
type Discrete type moving(int) mapping(const(int)) moving(string) mapping(const(string)) moving(bool) mapping(const(bool)) moving(real) mapping(ureal) moving(point) mapping(upoint) moving(points) mapping(upoints) moving(line) mapping(uline) moving(region) mapping(uregion) The sliced representation is built by a type constructor mapping parameterized by the(More)
Abstract. Let G=(V,E) be a 2-edge connected, undirected and nonnegatively weighted graph, and let S(r) be a single source shortest paths tree (SPT) of G rooted at r ∈ V . Whenever an edge e in S(r) fails, we are interested in reconnecting the nodes now disconnected from the root by means of a single edge e' crossing the cut created by the removal of e .(More)
In an undirected, 2-node connected graph G = (V,E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in G. The removal of a node and its incident edges from G may increase the distance from r to s. A most vital node of a given shortest path from r to s is a node (other than r and s)(More)
Let PG(r, s) denote a shortest path between two nodes r and s in an undirected graph G = (V ,E) such that |V | = n and |E| = m and with a positive real length w(e) associated with any e ∈ E. In this paper we focus on the problem of finding an edge e∗ ∈ PG(r, s) whose removal is such that the length of PG−e∗(r, s) is maximum, where G − e∗ = (V ,E \ {e∗}).(More)