In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...