2079 search results - page 123 / 416 » Universality of random graphs |
125
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
146
click to vote
SC
2005
ACM
15 years 10 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
150
click to vote
MFPS
1993
15 years 8 months ago
1993
al abstract machine for graph reduction Alan Jeffrey Report 3/92 August 1992 Computer Science School of Cognitive and Computing Sciences University of Sussex Brighton BN1 9QH ISSN ...
132
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
114
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...