) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm, SIAM Journal on Computing, vol.27, issue.1, 1997. ,
DOI : 10.1137/S0097539794285983
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.2592
On lipschitz embedding of finite metric spaces in Hilbert space, Israel Journal of Mathematics, vol.26, issue.1-2, pp.46-52, 1985. ,
DOI : 10.1007/BF02776078
Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis, Journal of the American Statistical Association, vol.104, issue.485, pp.209-219, 2009. ,
DOI : 10.1198/jasa.2009.0111
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.5567
Hierarchical structure and the prediction of missing links in networks, Nature, vol.104, issue.7191, pp.98-101, 2008. ,
DOI : 10.1038/nature06830
Vivaldi: A decentralized network coordinate system, SIGCOMM, pp.15-26, 2004. ,
A heuristic for graph drawing, Congressus Numerantium, vol.42, pp.149-160, 1984. ,
Limiting privacy breaches in privacy preserving data mining, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.211-222, 2003. ,
DOI : 10.1145/773153.773174
Recovering the Long-Range Links in Augmented Graphs, SIROCCO, p.118, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00147536
Graph drawing by force-directed placement, Software: Practice and Experience, vol.41, issue.11, 1991. ,
DOI : 10.1002/spe.4380211102
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8444
From Web to Map: Exploring the World of Music, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp.242-248, 2008. ,
DOI : 10.1109/WIIAT.2008.20
An r-dimensional quadratic placement algorithm, Management Science, 1970. ,
DOI : 10.1287/mnsc.17.3.219
Gossip-based peer sampling, ACM Transactions on Computer Systems, vol.25, issue.3, p.8, 2007. ,
DOI : 10.1145/1275517.1275520
A decentralized algorithm for spectral analysis, STOC, pp.561-568, 2004. ,
The small-world phenomenon, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.163-170, 2000. ,
DOI : 10.1145/335305.335325
Complex networks and decentralized search algorithms, In ICM, 2006. ,
DOI : 10.4171/022-3/50
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.410
Drawing graphs by eigenvectors: theory and practice, Computers & Mathematics with Applications, vol.49, issue.11-12, pp.1867-1888, 2005. ,
DOI : 10.1016/j.camwa.2004.08.015
URL : http://doi.org/10.1016/j.camwa.2004.08.015
The link-prediction problem for social networks, ASIS&T, issue.7, p.58, 2007. ,
The geometry of graphs and some of its algorithmic applications, Combinatorica, vol.15, pp.577-591, 1994. ,
An Energy Model for Visual Graph Clustering, Graph Drawing, pp.425-436, 2003. ,
DOI : 10.1007/978-3-540-24595-7_40
Modularity clustering is force-directed layout, Physical Review E, vol.79, issue.2, 2009. ,
DOI : 10.1103/PhysRevE.79.026102
URL : http://arxiv.org/abs/0807.4052
Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.387, issue.7043, pp.435814-818, 2005. ,
DOI : 10.1038/nature03248
The case against accuracy estimation for comparing induction algorithms, ICML, 1998. ,
Nonlinear Dimensionality Reduction by Locally Linear Embedding, Science, vol.290, issue.5500, p.2323, 2000. ,
DOI : 10.1126/science.290.5500.2323
URL : http://astro.temple.edu/~msobel/courses_files/saulmds.pdf
Interactive Visualization of Small World Graphs, IEEE Symposium on Information Visualization, pp.199-206, 2004. ,
DOI : 10.1109/INFVIS.2004.43
Epidemic-Style Management of Semantic Overlays for Content-Based Searching, EuroPar, pp.1143-1152, 2005. ,
DOI : 10.1007/11549468_125
Proof of the squashed cube conjecture, Combinatorica, vol.7, issue.4, pp.135-139, 1983. ,
DOI : 10.1007/BF02579350