Fetching the paper…
Reading the bibliography…
Graph analysis is a critical component of applications such as online social networks, protein interactions in biological networks, and Internet traffic analysis.
R. Kleinberg, “Geographic routing using hyperbolic space,” in
1909
Earlier work this paper cites.
J. A. Nelder and R. Mead, “A simplex method for function minimization,”
1965
Earlier work this paper cites.
N. Linial, E. London, and Y. Rabinovich, “The geometry of graphs and some of its algorithmic applications,”
1994
Earlier work this paper cites.
P. Francis
1999
Earlier work this paper cites.
S. Rao, “Small distortion and volume preserving embeddings for planar and euclidean metrics,” in
1999
Earlier work this paper cites.
T. S. E. Ng and H. Zhang, “Predicting internet network distance with coordinates-based approaches,” in
2002
Earlier work this paper cites.
C. R. Palmer, C. Faloutsos, and P. B. Gibbons, “ANF: A Fast and Scalable Tool for Data Mining in Massive Graphs,” in
2002
Earlier work this paper cites.
L. Tang and M. Crovella, “Virtual landmarks for the Internet,” in
2003
Earlier work this paper cites.
F. Dabek
2004
Earlier work this paper cites.
Y. Shavitt and T. Tankel, “Big-bang simulation for embedding network distances in euclidean space,”
2004
Earlier work this paper cites.
E. K. Lua
2005
Earlier work this paper cites.
M. J. Rattigan
2006
Cited alongside, same era.
J. R. Lee, “Volume distortion for subsets of euclidean spaces: extended abstract,” in
2006
Cited alongside, same era.
A. Mislove, K. P. Gummadi, and P. Druschel, “Exploiting social networks for internet search,” in
2006
Cited alongside, same era.
A. Mislove
2007
Cited alongside, same era.
S. G. Kobourov and M. Landis, “Morphing planar graphs in spherical space,” in
2007
Cited alongside, same era.
G. Swamynathan
2008
Cited alongside, same era.
C. Lumezanu and N. Spring, “Measurement manipulation and space selection in network coordinates,” in
W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in
2009
Later among the works it cites.
F. Benevenuto
2009
Later among the works it cites.
F. Schneider
2009
Later among the works it cites.
X. Zhao, A. Sala, C. Wilson, H. Zheng, and B. Y. Zhao, “Orion: Shortest path estimation for large social graphs,” in
2010
Later among the works it cites.
J. Jiang
2010
Later among the works it cites.
F. Papadopoulos, D. Krioukov, M. Boguñá, and A. Vahdat, “Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces,” in
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
Y. Shavitt and T. Tankel, “Hyperbolic embedding of internet graph for distance estimation and overlay construction,”
2008
Cited alongside, same era.
M. Potamias
2009
Cited alongside, same era.
C. Wilson
2009
Cited alongside, same era.
A. Cvetkovski and M. Crovella, “Hyperbolic embedding and routing for dynamic graphs,” in
2009
Cited alongside, same era.
2010
Later among the works it cites.
B. Viswanath and A. Post, “An Analysis of Social Network-Based Sybil Defenses,” in
2010
Later among the works it cites.
A. D. Sarma
2010
Later among the works it cites.
A. Gubichev
2010
Later among the works it cites.
T. Neumann and G. Weikum, “The rdf-3x engine for scalable management of rdf data,”
2010
Later among the works it cites.