One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...