401 search results - page 1 / 81 » Sparse Quasi-Random Graphs |
41
Voted
COMBINATORICA
2002
14 years 9 months ago
2002
72
Voted
CPC
2002
14 years 9 months ago
2002
INFOCOM
2011
IEEE
14 years 24 days 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...
108
click to vote
CVPR
2012
IEEE
12 years 11 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...
119
click to vote
IAJIT
2011
14 years 26 days 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...