4171 search results - page 145 / 835 » Choice numbers of graphs |
178
click to vote
JDA
2010
15 years 5 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
171
click to vote
CPC
2007
15 years 6 months ago
2007
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
199
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
166
click to vote
ATAL
2007
Springer
16 years 22 days ago
2007
Springer
Ranking systems are a fundamental ingredient of multi-agent environments and Internet Technologies. These settings can be viewed as social choice settings with two distinguished p...
165
click to vote
SIGECOM
2005
ACM
16 years 3 days ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...