This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
: Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organizat...
Abstract. In this short paper we describe the setup and results of a new initiative to compare graph transformation tools, carried out as part of the AGTIVE 2007 symposium on “Ap...