1067 search results - page 23 / 214 » Probabilistic regular graphs |
CORR
2008
Springer
15 years 15 days ago
2008
Springer
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.
87
Voted
COMBINATORICS
2006
15 years 14 days ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
82
Voted
EJC
2007
15 years 12 days ago
2007
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
94
Voted
TIP
2008
15 years 10 days ago
2008
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
112
Voted
SCALESPACE
2007
Springer
15 years 6 months ago
2007
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...