132 search results - page 9 / 27 » Graph limits and hereditary properties |
ICCS
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
ICOIN
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
NETWORKING
2007
13 years 11 months ago
2007
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...