Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
In the past few years, street-level geoviewers has become a very popular web-application. In this paper, we focus on a first urban concept which has been identified as useful for...
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...