{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:35:44Z","timestamp":1769978144369,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662476710","type":"print"},{"value":"9783662476727","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_36","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"444-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["On Temporal Graph Exploration"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Kammer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579276","volume":"2","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Largest random component of a k-cube. Combinatorica 2(1), 1\u20137 (1982)","journal-title":"Combinatorica"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"KA Berman","year":"1996","unstructured":"Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem. Networks 28(3), 125\u2013134 (1996)","journal-title":"Networks"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Measuring temporal lags in delay-tolerant networks. In: Proc. 25th Conference on IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2011), pp. 209\u2013218. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.29"},{"issue":"5","key":"36_CR5","first-page":"387","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS 27(5), 387\u2013408 (2012)","journal-title":"IJPEDS"},{"key":"36_CR6","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. CoRR abs\/1504.07976 (2015). arXiv: 1504.07976"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-642-10631-6_55","volume-title":"Algorithms and Computation","author":"P Flocchini","year":"2009","unstructured":"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\u2013543. Springer, Heidelberg (2009)"},{"key":"36_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Nelson, G., Tamaki, H.: On the fault tolerance of the butterfly. In: Proc. 26th Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 125\u2013133. ACM (1994)","DOI":"10.1145\/195058.195117"},{"issue":"4","key":"36_CR10","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01197577","volume":"74","author":"H Kesten","year":"1980","unstructured":"Kesten, H.: The critical probability of bond percolation on the square lattice equals $${1\\over 2}$$. Comm. Math. Phys. 74(1), 41\u201359 (1980)","journal-title":"Comm. Math. Phys."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Kloks, T. (ed.): Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0045375"},{"issue":"9","key":"36_CR13","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TPDS.2008.218","volume":"20","author":"C Liu","year":"2009","unstructured":"Liu, C., Wu, J.: Scalable routing in cyclic mobile networks. IEEE Trans. Parallel Distrib. Syst. 20(9), 1325\u20131338 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013)"},{"key":"36_CR15","unstructured":"Michail, O.: An introduction to temporal graphs: An algorithmic perspective. CoRR abs\/1503.00278 (2015). arXiv: 1503.00278"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-662-44465-8_47","volume-title":"Mathematical Foundations of Computer Science 2014","author":"O Michail","year":"2014","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 553\u2013564. Springer, Heidelberg (2014)"},{"key":"36_CR17","unstructured":"Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical Report 396, Department of Mathematics, Techni-sche Universit\u00e4t Berlin (1994)"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-45841-7_2","volume-title":"STACS 2002","author":"C Scheideler","year":"2002","unstructured":"Scheideler, C.: Models and techniques for communication in dynamic networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 27\u201349. Springer, Heidelberg (2002)"},{"key":"36_CR19","unstructured":"Shannon, C.: Presentation of a maze-solving machine. In: Proc. 8th Conference of the Josiah Macy Jr. Found (Cybernetics), pp. 173\u2013180 (1951)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:24:45Z","timestamp":1674228285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}