Advertisement

Exploration of Constantly Connected Dynamic Graphs Based on Cactuses

  • David Ilcinkas
  • Ralf Klasing
  • Ahmed Mouhamadou Wade
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8576)

Abstract

We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected dynamic graphs. This problem has already been studied in the case where the agent knows the dynamics of the graph and the underlying graph is a ring of n vertices [5]. In this paper, we consider the same problem and we suppose that the underlying graph is a cactus graph (a connected graph in which any two simple cycles have at most one vertex in common). We propose an algorithm that allows the agent to explore these dynamic graphs in at most \(2^{O(\sqrt{\log n})} n\) time units. We show that the lower bound of the algorithm is \(2^{\Omega(\sqrt{\log n})} n\) time units.

Keywords

Exploration Dynamic graphs Mobile agent Connectivity over time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burkard, R., Krarup, J.: A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus. Computing 60(3), 193–216 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems 27(5) (2012)Google Scholar
  3. 3.
    Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z.: Information spreading in dynamic networks. CoRR, abs/1112.0384 (2011)Google Scholar
  4. 4.
    Ferreira, A.: Building a Reference Combinatorial Model for Dynamic Networks: Initial Results in Evolving Graphs. INRIA, RR-5041 (2003)Google Scholar
  5. 5.
    Ilcinkas, D., Wade, A.M.: Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 13–23. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  6. 6.
    Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing (STOC), pp. 513–522 (2010)Google Scholar
  7. 7.
    Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. ACM SIGACT News 42(1), 82–96 (2011)CrossRefGoogle Scholar
  8. 8.
    Mömke, T., Svensson, O.: Approximating Graphic TSP by Matchings. In: 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 560–569 (2011)Google Scholar
  9. 9.
    Mucha, M.: 13/9-approximation for Graphic TSP. In: 29th Int. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 30–41 (2012)Google Scholar
  10. 10.
    O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC, pp. 104–110 (2005)Google Scholar
  11. 11.
    Sebö, A., Vygen, J.: Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Combinatorica (to appear)Google Scholar
  12. 12.
    Shannon, C.E.: Presentation of a maze-solving machine. In: 8th Conf. of the Josiah Macy Jr. Found (Cybernetics), pp. 173–180 (1951)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • David Ilcinkas
    • 1
  • Ralf Klasing
    • 1
  • Ahmed Mouhamadou Wade
    • 1
  1. 1.LaBRICNRS and Bordeaux UniversityFrance

Personalised recommendations