Introduction to algorithms
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Communications of the ACM
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Modern Information Retrieval
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Reference-based indexing of sequence databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Fast Random Walk with Restart and Its Applications
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Yes, there is a correlation: - from social networks to personal behavior on the web
Proceedings of the 17th international conference on World Wide Web
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Approximate embedding-based subsequence matching of time series
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Discovering leaders from community actions
Proceedings of the 17th ACM conference on Information and knowledge management
Searching the wikipedia with contextual information
Proceedings of the 17th ACM conference on Information and knowledge management
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Approximating betweenness centrality
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Brief announcement: revisiting the power-law degree distribution for social graph analysis
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Orion: shortest path estimation for large social graphs
WOSN'10 Proceedings of the 3rd conference on Online social networks
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Distance distribution and average shortest path length estimation in real-world networks
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
SPRINT: ranking search results by paths
Proceedings of the 14th International Conference on Extending Database Technology
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Real-time diameter monitoring for time-evolving graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Benefits of bias: towards better characterization of network sampling
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient centrality monitoring for time-evolving graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Online computation of fastest path in time-dependent spatial networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Discovering personalized routes from trajectories
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Relational approach for shortest path discovery over large graphs
Proceedings of the VLDB Endowment
The filter-placement problem and its application to minimizing information multiplicity
Proceedings of the VLDB Endowment
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
StormRider: harnessing "storm" for social networks
Proceedings of the 21st international conference companion on World Wide Web
Effective caching of shortest paths for location-based services
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Spatial big-data challenges intersecting mobility and cloud computing
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Traffic aware route planning in dynamic road networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Shortest paths in less than a millisecond
Proceedings of the 2012 ACM workshop on Workshop on online social networks
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
A survey on proximity measures for social networks
Search Computing
Efficient breadth-first search on large graphs with skewed degree distributions
Proceedings of the 16th International Conference on Extending Database Technology
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Outsourcing shortest distance computing with privacy protection
The VLDB Journal — The International Journal on Very Large Data Bases
Network-aware search in social tagging applications: instance optimality versus efficiency
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Optimizing Landmark-Based Routing and Preprocessing
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Efficient simrank-based similarity join over large graphs
Proceedings of the VLDB Endowment
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landmarks and computing offline the distances from each node in the graph to those landmarks. At runtime, when the distance between a pair of nodes is needed, it can be estimated quickly by combining the precomputed distances. We prove that selecting the optimal set of landmarks is an NP-hard problem, and thus heuristic solutions need to be employed. We therefore explore theoretical insights to devise a variety of simple methods that scale well in very large networks. The efficiency of the suggested techniques is tested experimentally using five real-world graphs having millions of edges. While theoretical bounds support the claim that random landmarks work well in practice, our extensive experimentation shows that smart landmark selection can yield dramatically more accurate results: for a given target accuracy, our methods require as much as 250 times less space than selecting landmarks at random. In addition, we demonstrate that at a very small accuracy loss our techniques are several orders of magnitude faster than the state-of-the-art exact methods. Finally, we study an application of our methods to the task of social search in large graphs.