401 search results - page 1 / 81 » Sparse Quasi-Random Graphs |
COMBINATORICA
2002
13 years 5 months ago
2002
CPC
2002
13 years 5 months ago
2002
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
IAJIT
2011
12 years 8 months ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...