On the power of waiting when exploring public transportation systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7109 LNCS, Issue , 2011, Pages 451-464

  Ilcinkas, David ^a   Wade, Ahmed Mouhamadou ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Dynamic graphs; Exploration; Mobile agent; PV graph

Indexed keywords

DYNAMIC GRAPH; DYNAMIC NETWORK; MOBILE ENTITIES; MULTIPLICATIVE FACTORS; OPTIMAL NUMBER; OPTIMAL RESULTS; PUBLIC TRANSPORTATION SYSTEMS; PV-GRAPH; SUFFICIENT CONDITIONS; TIME COMPLEXITY;

GRAPHIC METHODS; MOBILE AGENTS; NATURAL RESOURCES EXPLORATION; OPTIMIZATION;

PROBLEM SOLVING;

EID: 84055212609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25873-2_31     Document Type: Conference Paper

References (9)

1. Avin, C., Koucký, M., Lotker, Z.: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121-132. Springer, Heidelberg (2008)
2. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. CoRR, abs/1012.0009 (2010)
3. Cooper, C., Frieze, A.M.: Crawling on simple models of web graphs. Internet Mathematics 1(1) (2003)
4. Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theor. Comput. Sci. 326(1-3), 343-362 (2004)
5. Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Mapping an Unfriendly Subway System. In: Boldi, P. (ed.) FUN 2010. LNCS, vol. 6099, pp. 190-201. Springer, Heidelberg (2010)
6. Flocchini, P., Mans, B., Santoro, N.: Exploration of Periodically Varying Graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 534-543. Springer, Heidelberg (2009)
7. 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)
8. Panaite, P., Pelc, A.: Exploring Unknown Undirected Graphs. J. Algorithms 33(2), 281-295 (1999)
9. Reingold, O.: Undirected st-connectivity in log-space. In: 37th ACM Symposium on Theory of Computing (STOC), pp. 376-385 (2005)