Skip to main content
SpringerLink
Log in

A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs

  • Conference paper
  • First Online:
Book cover Structural Information and Communication Complexity (SIROCCO 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10641))

Abstract

We presented in [12] an algorithm for computing a parameter called T -interval connectivity of dynamic graphs which are given as a sequence of static graphs. This algorithm operates at a high level, manipulating the graphs in the sequence as atomic elements with two types of operations: a composition operation and a test operation. The algorithm is optimal in the sense that it uses only \(O(\delta )\) composition and test operations, where \(\delta \) is the length of the sequence. In this paper, we generalize this framework to use various composition and test operations, which allows us to compute other parameters using the same high-level strategy that we used for T-interval connectivity. We illustrate the framework through the study of three minimization problems which refer to various properties of dynamic graphs, namely Bounded-Realization-of-the-Footprint, Temporal-Connectivity, and Round-Trip-Temporal-Diameter.

Part of this work was done while Joseph Peters was visiting the LaBRI as a guest professor of the University of Bordeaux. This work was partially funded by the ANR projects DISPLEXITY (ANR-11-BS02-014) and ESTATE (ANR-16-CE25-0009-03). This study has been carried out in the frame of “The Investments for the Future” Programme IdEx Bordeaux CPU (ANR-10-IDEX-03-02). The work of Joseph Peters was partially supported by NSERC of Canada.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 29–41. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-12340-0_3

    Google Scholar 

  2. Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 278–281. ACM (1984)

    Google Scholar 

  3. Barjon, M., Casteigts, A., Chaumette, S., Johnen, C., Neggaz, Y.M.: Testing temporal connectivity in sparse dynamic graphs. CoRR abs/1404.7634 (2014). (A French version appeared in Proceedings of ALGOTEL 2014)

    Google Scholar 

  4. Bournat, M., Datta, A.K., Dubois, S.: Self-stabilizing robots in highly dynamic environments. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 54–69. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49259-9_5

    Chapter  Google Scholar 

  5. Bramas, Q., Tixeuil, S.: The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255, 369–383 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  6. Braud-Santoni, N., Dubois, S., Kaaouachi, M.H., Petit, F.: The next 700 impossibility results in time-varying graphs. Int. J. Netw. Comput. 6(1), 27–41 (2016)

    Article  Google Scholar 

  7. Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. of Found. Comput. Sci. 14(2), 267–285 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Casteigts, A., Chaumette, S., Ferreira, A.: Characterizing topological assumptions of distributed algorithms in dynamic networks. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 126–140. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11476-2_11. Full version in CoRR, abs/1102.5529

    Chapter  Google Scholar 

  9. Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Measuring temporal lags in delay-tolerant networks. IEEE Trans. Comput. 63(2), 397–410 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Shortest, fastest, and foremost broadcast in dynamic networks. Int. J. Found. Comput. Sci. 26(4), 499–522 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel, Emergent Distrib. Syst. 27(5), 387–408 (2012)

    Article  Google Scholar 

  12. Casteigts, A., Klasing, R., Neggaz, Y.M., Peters, J.G.: Efficiently testing \(T\)-interval connectivity in dynamic graphs. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 89–100. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18173-8_6

    Chapter  Google Scholar 

  13. Casteigts, A., Klasing, R., Neggaz, Y.M., Peters, J.G.: Calcul de Paramètres Minimaux dans les Graphes Dynamiques. In: 19èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL) (2017)

    Google Scholar 

  14. Dubois, S., Kaaouachi, M.-H., Petit, F.: Enabling minimal dominating set in highly dynamic distributed systems. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 51–66. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21741-3_4

    Chapter  Google Scholar 

  15. Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theor. Comput. Sci. 469, 53–68 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gibbons, A., Rytter, W.: Efficient Parallel Algorithms. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  17. Godard, E., Mazauric, D.: Computing the dynamic diameter of non-deterministic dynamic networks is hard. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014. LNCS, vol. 8847, pp. 88–102. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46018-4_6

    Google Scholar 

  18. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proceedings of SIGCOMM, pp. 145–158 (2004)

    Google Scholar 

  19. JáJá, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Boston (1992)

    MATH  Google Scholar 

  20. Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of STOC, pp. 513–522. ACM (2010)

    Google Scholar 

  21. O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of DIALM-POMC, pp. 104–110. ACM (2005)

    Google Scholar 

  22. Raynal, M., Stainer, J., Cao, J., Wu, W.: A simple broadcast algorithm for recurrent dynamic systems. In: 2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA), pp. 933–939. IEEE (2014)

    Google Scholar 

  23. Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245–252 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  24. Whitbeck, J., Dias de Amorim, M., Conan, V., Guillaume, J.L.: Temporal reachability graphs. In: Proceedings of MOBICOM, pp. 377–388. ACM (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, CNRS, University of Bordeaux, Talence, France

    Arnaud Casteigts & Ralf Klasing

  2. IRIT - SMAC Team, University of Toulouse, Toulouse, France

    Yessin M. Neggaz

  3. School of Computing Science, Simon Fraser University, Burnaby, BC, Canada

    Joseph G. Peters

Authors
  1. Arnaud Casteigts
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Klasing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yessin M. Neggaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joseph G. Peters
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Arnaud Casteigts , Ralf Klasing , Yessin M. Neggaz or Joseph G. Peters .

Editor information

Editors and Affiliations

  1. LIF, Aix-Marseille University, Marseille Cedex 9, France

    Shantanu Das

  2. LIP6, Université Pierre et Marie Curie - Paris 6, Paris, France

    Sebastien Tixeuil

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Casteigts, A., Klasing, R., Neggaz, Y.M., Peters, J.G. (2017). A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. In: Das, S., Tixeuil, S. (eds) Structural Information and Communication Complexity. SIROCCO 2017. Lecture Notes in Computer Science(), vol 10641. Springer, Cham. https://doi.org/10.1007/978-3-319-72050-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72050-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72049-4

  • Online ISBN: 978-3-319-72050-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation