Fast shortest path distance estimation in large networks

Fast shortest path distance estimation in large networks (2009)

Cached

Download Links

by Michalis Potamias , Carlos Castillo , Francesco Bonchi , Aristides Gionis

Citations:

BibTeX

@MISC{Potamias09fastshortest,
    author = {Michalis Potamias and Carlos Castillo and Francesco Bonchi and Aristides Gionis},
    title = {Fast shortest path distance estimation in large networks},
    year = {2009}
}

Bookmark

OpenURL

Abstract

Citations

1128	Probability inequalities for sums of bounded random variables - Hoeffding - 1963
1011	A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959
616	A fast and high quality multilevel scheme for partitioning irregular graphs - Karypis, Kumar - 1999
449	ME: Community structure in social and biological networks - Girvan, Newman
441	Predicting internet network distance with coordinates-based approaches - NG, ZHANG
405	2004 Finding and evaluating community structure in networks - Newman, Girvan
376	Faust K: Social Network Analysis - Wasserman - 1994
365	Vivaldi: a decentralized network coordinate system - Dabek, Cox, et al.
303	A greedy heuristic for the set-covering problem - Chvatal - 1979
298	Inferring web communities from link topology - Gibson, Kleinberg, et al. - 1998
257	RW: Algorithm 97 Shortest Path - Floyd - 1969
253	Introduction to Algorithms. 2nd edition - Cormen, Leiserson, et al. - 1990
243	On Lipschitz embedding of finite metric spaces in Hilbert space - Bourgain - 1985
190	A simple general approach to inference about the tail of a distribution - Hill - 1975
175	A set of measures of centrality based on betweenness - Freeman - 1977
169	A faster algorithm for betweenness centrality - Brandes
163	Group formation in large social networks: membership, growth, and evolution - Backstrom, Huttenlocher, et al. - 2006
154	Approximate distance oracles - Thorup, Zwick
152	Structure and evolution of online social networks - Kumar, Novak, et al.
126	Virtual landmarks for the internet - Tang, Crovella - 2003
74	Computing the shortest path: A* search meets graph theory - Goldberg, Harrelson - 2005
70	Properties of embedding methods for similarity searching in metric spaces - Hjaltason, Samet - 2003
65	Triangulation and embedding using small sets of beacons - Kleinberg, Slivkins, et al. - 2004
64	Trawling the web for emerging cyber-communities. Computer Networks - Kumar, Raghavan, et al. - 1999
49	Reach for a*: Efficient point-to-point shortest path algorithms - Goldberg, Kaplan, et al. - 2006
45	Towards scaling fully personalized pagerank - Fogaras, Racz
43	Exact and approximate distances in graphs – a survey - Zwick
41	Bi-directional search - Pohl - 1971
32	B (2003) Natural communities in large linked networks - Hopcroft, Khan, et al.
30	B.: Modern Information Retrieval - Baeza, Ribeiro - 1999
30	Yes, there is a correlation - from social networks to personal behavior on the web - Singla, Richardson
28	Scalable network distance browsing in spatial databases - Samet, Sankaranarayanan, et al. - 2008
25	The sociological concept of 'group': an empirical test of two models - Freeman - 1992
23	Metric embeddings with relaxed guarantees - Abraham, Bartal, et al. - 2005
21	Naor M., “Optimal Aggregation Algorithms For Middleware - Fagin, Lotem - 2001
15	Efficient network aware search in collaborative tagging sites - Amer-Yahia, Benedikt, et al.
15	Approximating betweenness centrality - Bader, Kintali, et al. - 2007
10	Embedding-based subsequence matching in time-series databases - Papapetrou, Athitsos, et al. - 2011
7	Discovering leaders from community actions - Goyal, Bonchi, et al. - 2008
6	Efficiently indexing shortest paths by exploiting symmetry in graphs - Xiao, Wu, et al. - 2009
5	Using structure indices for efficient approximation of network properties - Rattigan, Majer, et al. - 2006
4	Reference-based indexing of sequence databases - Venkateswaran, Lachwani, et al. - 2006
4	Efficient search ranking in social networks - Vieira, Fonseca, et al.
3	Point-to-point shortest path algorithms with preprocessing - Goldberg - 2007
1	A Fast Alogrithm for Finding Better Routes by AI Search Techniques - Ikeda, Hsu, et al. - 1994
1	Vivaldi: a decentralized network coordinate system - Kriegel, Renz, et al.
1	Faloutsos and J-Y.Pan. Fast random walk with restart and its applications - Tong, C - 2006
1	Searching the wikipedia with contextual information - Ukkonen, Castillo, et al. - 2008
1	Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks - Kraft, Chang, et al.