1542 search results - page 42 / 309 » The metamathematics of random graphs |
253
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
133
click to vote
TMC
2011
14 years 8 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
120
click to vote
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
100
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
90
Voted
COMBINATORICA
2008
15 years 1 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...