Fast collaborative graph exploration

Awerbuch, 1999, Piecemeal graph exploration by a mobile robot, Inf. Comput., 152, 155, 10.1006/inco.1999.2795 Bender, 2002, The power of a pebble: exploring and mapping directed graphs, Inf. Comput., 176, 1, 10.1006/inco.2001.3081 Bender, 1994, The power of team exploration: two robots can learn unlabeled directed graphs, 75 Brass, 2011, Multirobot tree and graph exploration, IEEE Trans. Robot., 27, 707, 10.1109/TRO.2011.2121170 Czyzowicz, 2013, Worst-case optimal exploration of terrains with obstacles, Inf. Comput., 225, 16, 10.1016/j.ic.2013.02.001 Dereniowski, 2013, Fast collaborative graph exploration, vol. 7966, 520 Dessmark, 2004, Optimal graph exploration without good maps, Theor. Comput. Sci., 326, 343, 10.1016/j.tcs.2004.07.031 Duncan, 2006, Optimal constrained graph exploration, ACM Trans. Algorithms, 2, 380, 10.1145/1159892.1159897 Dynia, 2006, Power-aware collective tree exploration, 341 Dynia, 2006, Smart robot teams exploring sparse trees, 327 Dynia, 2007, Why robots need maps, 41 Fraigniaud, 2006, Collective tree exploration, Networks, 48, 166, 10.1002/net.20127 Frederickson, 1978, Approximation algorithms for some routing problems, SIAM J. Comput., 7, 178, 10.1137/0207017 Gabriely, 2003, Competitive on-line coverage of grid environments by a mobile robot, Comput. Geom., 24, 197, 10.1016/S0925-7721(02)00110-4 Herrmann Higashikawa, 2012, Online exploration of all vertices in a simple polygon, 315 Higashikawa, 2014, Online graph exploration algorithms for cycles and trees by multiple searchers, J. Comb. Optim., 28, 480, 10.1007/s10878-012-9571-y Icking, 2000, Exploring an unknown cellular environment, 140 Kolenderska, 2009, An improved strategy for exploring a grid polygon, 222 Łopuszański, 2007 Ortolf, 2012, Online multi-robot exploration of grid graphs with rectangular obstacles, 27 Panaite, 1999, Exploring unknown undirected graphs, J. Algorithms, 33, 281, 10.1006/jagm.1999.1043