Skip to main content
SpringerLink
Log in

Finding Colorful Paths in Temporal Graphs

  • Conference paper
  • First Online:
Complex Networks & Their Applications X (COMPLEX NETWORKS 2021)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 1072))

Included in the following conference series:

  • 3750 Accesses

Abstract

The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have distinct colors and include the maximum number of colors. We study the approximation complexity of the problem and we provide an inapproximability lower bound. Then we present a heuristic for the problem and an experimental evaluation of our heuristic, both on synthetic and real-world graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 349.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 449.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://snap.stanford.edu/data/.

References

  1. Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Raptopoulos, C.L.: The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120, 179–193 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bonizzoni, P., Dondi, R., Pirola, Y.: Maximum disjoint paths on edge-colored graphs: approximability and tractability. Algorithms 6(1), 1–11 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 107–121. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79987-8_8

    Chapter  Google Scholar 

  5. Casteigts, A., Himmel, A., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. In: Cao, Y., Cheng, S., Li, M. (eds.) In: Proceeding of the 31st International Symposium on Algorithms and Computation, ISAAC 2020, pp. 30:1–30:18 (2020)

    Google Scholar 

  6. Castelli, M., Dondi, R., Hosseinzadeh, M.M.: Genetic algorithms for finding episodes in temporal networks. Procedia Comput. Sci. 176, 215–224 (2020)

    Article  Google Scholar 

  7. Choudhury, M.D., Feldman, M., Amer-Yahia, S., Golbandi, N., Lempel, R., Yu, C.: Automatic construction of travel itineraries using social breadcrumbs. In: Chignell, M.H., Toms, E.G. (eds.) HT 2010, Proceedings of the 21st ACM Conference on Hypertext and Hypermedia 13–16 2010, pp. 35–44 (2010)

    Google Scholar 

  8. Cohen, J., Italiano, G.F., Manoussakis, Y., Thang, N.K., Pham, H.P.: Tropical paths in vertex-colored graphs. J. Comb. Optim. 42(3), 476–498 (2019). https://doi.org/10.1007/s10878-019-00416-y

    Article  MathSciNet  MATH  Google Scholar 

  9. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)

    MATH  Google Scholar 

  10. Dondi, R., Hosseinzadeh, M.M.: Dense sub-networks discovery in temporal networks. SN Comput. Sci. 2(3), 1–11 (2021)

    Article  Google Scholar 

  11. Dondi, R., Sikora, F.: Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4), 1315–1332 (2017). https://doi.org/10.1007/s10878-017-0238-6

    Article  MathSciNet  MATH  Google Scholar 

  12. Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. J. Comput. Syst. Sci. 119, 1–18 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gionis, A., Lappas, T., Pelechrinis, K., Terzi, E.: Customized tour recommendations in urban areas. In: Carterette, B., Diaz, F., Castillo, C., Metzler, D. (eds.) Seventh ACM International Conference on Web Search and Data Mining, WSDM 2014, pp. 313–322 (2014)

    Google Scholar 

  14. Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using NetworkX. Technical report, Los Alamos National Lab. (LANL), Los Alamos, NM (United States) (2008)

    Google Scholar 

  15. Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(9), 1–30 (2015). https://doi.org/10.1140/epjb/e2015-60657-4

    Article  Google Scholar 

  16. Kowalik, L., Lauri, J.: On finding rainbow and colorful paths. Theor. Comput. Sci. 628, 110–114 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  17. Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http://snap.stanford.edu/data

  18. Marino, A., Silva, A.: Königsberg sightseeing: Eulerian walks in temporal graphs. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 485–500. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79987-8_34

    Chapter  Google Scholar 

  19. Thejaswi, S., Gionis, A., Lauri, J.: Finding path motifs in large temporal graphs using algebraic fingerprints. Big Data 8(5), 335–362 (2020)

    Article  Google Scholar 

  20. Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)

    Book  MATH  Google Scholar 

  21. Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721–732 (2014)

    Article  Google Scholar 

  22. Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng. 28(11), 2927–2942 (2016)

    Article  Google Scholar 

  23. Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107, 72–92 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  24. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Kleinberg, J.M. (ed.) Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 21–23 2006, pp. 681–690 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università degli Studi di Bergamo, Bergamo, Italy

    Riccardo Dondi & Mohammad Mehdi Hosseinzadeh

Authors
  1. Riccardo Dondi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Mehdi Hosseinzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Riccardo Dondi .

Editor information

Editors and Affiliations

  1. Escuela Técnica Superior de Ingeniería Agronómica, Alimentaria y de Biosistemas, Universidad Politécnica de Madrid, Madrid, Madrid, Spain

    Rosa Maria Benito

  2. IUT Lumière, University of Lyon, Bron Cedex, France

    Chantal Cherifi

  3. LIB, UFR Sciences et Techniques, University of Burgundy, Dijon, France

    Hocine Cherifi

  4. Grupo Interdisciplinar de Sistemas Complejos, Universidad Carlos III de Madrid, Leganés, Madrid, Spain

    Esteban Moro

  5. Thomas J. Watson College of Engineering and Applied Science, Binghamton University, Binghamton, USA

    Luis M. Rocha

  6. Department of Chemical Engineering, Universitat Rovira i Virgili, Tarragona, Tarragona, Spain

    Marta Sales-Pardo

Rights and permissions

Reprints and permissions

Copyright information

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

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dondi, R., Hosseinzadeh, M.M. (2022). Finding Colorful Paths in Temporal Graphs. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds) Complex Networks & Their Applications X. COMPLEX NETWORKS 2021. Studies in Computational Intelligence, vol 1072. Springer, Cham. https://doi.org/10.1007/978-3-030-93409-5_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93409-5_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93408-8

  • Online ISBN: 978-3-030-93409-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation