Sciweavers

505 search results - page 42 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
WWW
2007
ACM
15 years 10 months ago
Random web crawls
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...
Toufik Bennouas, Fabien de Montgolfier
JCT
2010
127views more  JCT 2010»
14 years 4 months ago
On the density of a graph and its blowup
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 ...
Asaf Shapira, Raphael Yuster
EJC
2010
14 years 9 months ago
Dualities in full homomorphisms
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...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
ITSSA
2006
91views more  ITSSA 2006»
14 years 9 months ago
Organization Detection Using Emergent Computing
: 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...
Cyrille Bertelle, Antoine Dutot, Fréd&eacut...
AGTIVE
2007
Springer
15 years 3 months ago
AGTIVE 2007 Graph Transformation Tool Contest
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...
Arend Rensink, Gabriele Taentzer