8 search results - page 1 / 2 » Creation and Growth of Components in a Random Hypergraph Pro... |
COCOON
2006
Springer
13 years 7 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
RSA
2000
13 years 5 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
RSA
2011
13 years 6 days ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
JCT
2008
13 years 5 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
VLDB
2007
ACM
13 years 11 months ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...