721 search results - page 31 / 145 » Almost universal graphs |
100
Voted
CPC
2007
15 years 23 days ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
103
click to vote
WAIM
2010
Springer
14 years 11 months ago
2010
Springer
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
FOCS
2008
IEEE
15 years 7 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 ...
78
Voted
AAAI
2007
15 years 3 months ago
2007
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology an...
132
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...