{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:24:56Z","timestamp":1780352696451,"version":"3.54.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319096193","type":"print"},{"value":"9783319096209","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09620-9_20","type":"book-chapter","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T02:07:37Z","timestamp":1405476457000},"page":"250-262","source":"Crossref","is-referenced-by-count":27,"title":["Exploration of Constantly Connected Dynamic Graphs Based on Cactuses"],"prefix":"10.1007","author":[{"given":"David","family":"Ilcinkas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed Mouhamadou","family":"Wade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"R. Burkard","year":"1998","unstructured":"Burkard, R., Krarup, J.: A Linear Algorithm for the Pos\/Neg-Weighted 1-Median Problem on a Cactus. Computing\u00a060(3), 193\u2013216 (1998)","journal-title":"Computing"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems\u00a027(5) (2012)","DOI":"10.1080\/17445760.2012.668546"},{"key":"20_CR3","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z.: Information spreading in dynamic networks. CoRR, abs\/1112.0384 (2011)"},{"key":"20_CR4","unstructured":"Ferreira, A.: Building a Reference Combinatorial Model for Dynamic Networks: Initial Results in Evolving Graphs. INRIA, RR-5041 (2003)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-03578-9_2","volume-title":"Structural Information and Communication Complexity","author":"D. Ilcinkas","year":"2013","unstructured":"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.\u00a08179, pp. 13\u201323. Springer, Heidelberg (2013)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing (STOC), pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F. Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. ACM SIGACT News\u00a042(1), 82\u201396 (2011)","journal-title":"ACM SIGACT News"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., Svensson, O.: Approximating Graphic TSP by Matchings. In: 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 560\u2013569 (2011)","DOI":"10.1109\/FOCS.2011.56"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Mucha, M.: 13\/9-approximation for Graphic TSP. In: 29th Int.\u00a0Symposium on Theoretical Aspects of Computer Science (STACS), pp. 30\u201341 (2012)","DOI":"10.1007\/s00224-012-9439-7"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC, pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"20_CR11","unstructured":"Seb\u00f6, 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)"},{"key":"20_CR12","unstructured":"Shannon, C.E.: Presentation of a maze-solving machine. In: 8th Conf. of the Josiah Macy Jr. Found (Cybernetics), pp. 173\u2013180 (1951)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09620-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:24:28Z","timestamp":1558952668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09620-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096193","9783319096209"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09620-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}