Skip to main content

Hop-Constrained s-t Simple Path Enumeration in Large Uncertain Graphs

  • 77 Accesses

Part of the Lecture Notes in Computer Science book series (LNCS,volume 13459)

Abstract

Uncertain graphs are graphs where each edge is assigned with a probability of existence. In this paper, we study the problem of hop-constrained s-t simple path enumeration in large uncertain graphs. To the best of our knowledge, we are the first to study this problem in the literature. Specifically, we propose a light-weight index to prune candidate paths by adopting the concept of probability-constrained distance. An efficient enumeration algorithm is designed based on the index structure. Experiment results on real-world datasets show that our proposed methods significantly outperform the baseline methods by up to 6 times.

Keywords

  • Graph
  • Uncertain graph
  • Path enumeration

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-031-15512-3_9
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-031-15512-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.

Notes

  1. 1.

    https://law.di.unimi.it/index.php.

  2. 2.

    https://snap.stanford.edu/data/.

References

  1. Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-paths in graphs. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 544–557. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77404-6_40

    CrossRef  Google Scholar 

  2. Kawahigashi, H., Terashima, Y., Miyauchi, N., Nakakawaji, T.: Modeling ad hoc sensor networks using random graph theory. In: Second IEEE Consumer Communications and Networking Conference, CCNC 2005, pp. 104–109 (2005). https://doi.org/10.1109/CCNC.2005.1405152

  3. Leser, U.: A query language for biological networks. In: ECCB/JBI’05 Proceedings, Fourth European Conference on Computational Biology/Sixth Meeting of the Spanish Bioinformatics Network (Jornadas de BioInformática), Palacio de Congresos, Madrid, Spain, 28 September–1 October 2005, p. 39 (2005). https://doi.org/10.1093/bioinformatics/bti1105

  4. Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, CIKM 2003, pp. 556–559. Association for Computing Machinery, New York (2003)

    Google Scholar 

  5. Peng, Y., Zhang, Y., Lin, X., Zhang, W., Qin, L., Zhou, J.: Hop-constrained s-t simple path enumeration: towards bridging theory and practice. Proc. VLDB Endow. 13(4), 463–476 (2019)

    CrossRef  Google Scholar 

  6. Qiu, X., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endow. 11(12), 1876–1888 (2018). https://doi.org/10.14778/3229863.3229874

  7. Rizzi, R., Sacomoto, G., Sagot, M.-F.: Efficiently listing bounded length st-paths. In: Kratochvíl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 318–329. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19315-1_28

    CrossRef  Google Scholar 

  8. Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS, vol. 4075, pp. 35–49. Springer, Heidelberg (2006). https://doi.org/10.1007/11799511_5

    CrossRef  Google Scholar 

  9. Sun, S., Chen, Y., He, B., Hooi, B.: Pathenum: towards real-time hop-constrained s-t path enumeration. In: Proceedings of SIGMOD, pp. 1758–1770 (2021)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xia Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Li, X., Hao, K., Yang, Z., Cao, X., Zhang, W. (2022). Hop-Constrained s-t Simple Path Enumeration in Large Uncertain Graphs. In: Hua, W., Wang, H., Li, L. (eds) Databases Theory and Applications. ADC 2022. Lecture Notes in Computer Science, vol 13459. Springer, Cham. https://doi.org/10.1007/978-3-031-15512-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-15512-3_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-15511-6

  • Online ISBN: 978-3-031-15512-3

  • eBook Packages: Computer ScienceComputer Science (R0)