The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Open accessAbstract
We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex. Seemingly too obvious and too inefficient at first glance, the key ingredient introduced here is pruning during breadth-first searches. While we can still answer the correct distance for any pair of vertices from the labels, it surprisingly reduces the search space and sizes of labels. Moreover, we show that we can perform 32 or 64 breadth-first searches simultaneously exploiting bitwise operations. We experimentally demonstrate that the combination of these two techniques is efficient and robust on various kinds of large-scale real-world networks. In particular, our method can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods, with comparable query time to those of previous methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Predicting positive and negative links in online social networks
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772756 · Cited by 1,470
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
Signed networks in social media
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753532 · Cited by 1,306
The webgraph framework I: compression techniques
Boldi, P., & Vigna, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988752 · Cited by 1,201
Trust Management for the Semantic Web
Richardson, M., Agrawal, R., & Domingos, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39718-2_23 · Cited by 982
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 766
Graph minors. III. Planar tree-width
Robertson, N., & Seymour, P. D. (1984) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(84)90013-3 · Cited by 718
Boldi, P., Rosa, M., Santini, M., & Vigna, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963488 · Cited by 592
Virtual landmarks for the internet
Tang, L., & Crovella, M. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948223 · Cited by 297
Fast shortest path distance estimation in large networks
Potamias, M., Bonchi, F., Castillo, C., & Gionis, A. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646063 · Cited by 291
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20662-7_20 · Cited by 254
Scalable Graph Exploration on Multicore Processors
Agarwal, V., Petrini, F., Pasetto, D., & Bader, D. A. (2010) · 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2010.46 · Cited by 223
Hierarchical Hub Labelings for Shortest Paths
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33090-2_4 · Cited by 218
Query preserving graph compression
Fan, W., Li, J., Wang, X., & Wu, Y. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213855 · Cited by 204
Wei, F. (2010) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1807167.1807181 · Cited by 155
Fast and accurate estimation of shortest paths in large graphs
Gubichev, A., Bedathur, S., Seufert, S., & Weikum, G. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871503 · Cited by 154
Rahman, S. A., & Schomburg, D. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl181 · Cited by 133
Fast computation of empirically tight bounds for the diameter of massive graphs
Magnien, C., Matthieu Latapy, B., & Habib, M. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1412228.1455266 · Cited by 127
Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC)
Rahman, S. A., Advani, P., Schunk, R., Schrader, R., & Schomburg, D. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bti116 · Cited by 125
Efficient network aware search in collaborative tagging sites
Amer-Yahia, S., Benedikt, M., Lakshmanan, L. V. S., & Stoyanovich, J. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453934 · Cited by 120
A highway-centric labeling approach for answering distance queries on large sparse graphs
Jin, R., Ruan, N., Xiang, Y., & Lee, V. (2012) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2213836.2213887 · Cited by 110
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Tretyakov, K., Armas-Cervantes, A., García‐Bañuelos, L., Vilo, J., & Dumas, M. (2011) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2063576.2063834 · Cited by 82
On-line exact shortest distance query processing
Cheng, J., & Yu, J. X. (2009) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1516360.1516417 · Cited by 76
Shortest-path queries for complex networks
Akiba, T., Sommer, C., & Kawarabayashi, K. (2012) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/2247596.2247614 · Cited by 68
Self-citationApproximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
Qiao, M., Cheng, H., Chang, L., & Yu, J. X. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.53 · Cited by 40
A compact routing scheme and approximate distance oracle for power-law graphs
Chen, W., Sommer, C., Teng, S., & Wang, Y. (2012) · ACM Transactions on Algorithms · doi:10.1145/2390176.2390180 · Cited by 38
Searching the wikipedia with contextual information
Ukkonen, A., Castillo, C., Donato, D., & Gionis, A. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458274 · Cited by 36
Cited by
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2015) · arXiv · doi:10.48550/arxiv.1504.05140 · Cited by 189
Metadata
- Authors
- Akiba, T., Iwata, Y., & Yoshida, Y.
- Venue
- Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2013-06-22
- Pages
- 349-360
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2005945380
- Cited by
- 400
- References
- 37
- FWCI
- 18.56
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.