Exploration of k-edge-deficient temporal graphs

[1]  Toshihide Ibaraki,et al.  A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph , 1992, Algorithmica.

[2]  Paul G. Spirakis,et al.  Traveling salesman problems in temporal graphs , 2016, Theor. Comput. Sci..

[3]  Othon Michail,et al.  An Introduction to Temporal Graphs: An Algorithmic Perspective* , 2015, Internet Math..

[4]  David Ilcinkas,et al.  Exploration of Constantly Connected Dynamic Graphs Based on Cactuses , 2014, SIROCCO.

[5]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[6]  Paul G. Spirakis,et al.  The temporal explorer who returns to the base , 2018, CIAC.

[7]  Genghua Fan.  Covering Graphs by Cycles , 1992, SIAM J. Discret. Math..

[8]  Rolf Niedermeier,et al.  The complexity of finding small separators in temporal graphs , 2020, J. Comput. Syst. Sci..

[9]  Hans L. Bodlaender,et al.  On exploring always-connected temporal graphs of small pathwidth , 2019, Inf. Process. Lett..

[10]  Bengt J. Nilsson,et al.  Online and Offline Algorithms for the Time-Dependent TSP with Time Zones , 2004, Algorithmica.

[11]  David Ilcinkas,et al.  Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring , 2013, SIROCCO.

[12]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, Symposium on the Theory of Computing.

[13]  Thomas Erlebach,et al.  Non-strict Temporal Exploration , 2020, SIROCCO.

[14]  Thomas Erlebach,et al.  On temporal graph exploration , 2021, J. Comput. Syst. Sci..