5451 search results - page 20 / 1091 » On very high degrees |
96
Voted
RSA
2006
15 years 1 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
152
click to vote
SIAMCOMP
2011
14 years 4 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
108
Voted
DEBS
2007
ACM
15 years 5 months ago
2007
ACM
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
116
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...