401 search results - page 5 / 81 » Sparse Quasi-Random Graphs |
DM
2006
13 years 7 months ago
2006
A sparse anti-magic square is an n
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...