{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:34Z","timestamp":1725663874246},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:12:18Z","timestamp":1330258338000},"page":"751-760","source":"Crossref","is-referenced-by-count":5,"title":["Paths and cycles in finite periodic graphs"],"prefix":"10.1007","author":[{"given":"Egon","family":"Wanke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"W. Backes, U. Schwiegelshohn, and L. Thiele. Analysis of free schedule in periodic graphs. Proceedings of the fourth annual ACM Symposium on Parallel Algorithms and Architectures, pages 333\u2013343, 1992.","DOI":"10.1145\/140901.141910"},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"E. Cohen and N. Megiddo. Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs. In Annual ACM Symposium on Theory of Computing, pages 523\u2013534, 1989.","DOI":"10.1145\/73007.73057"},{"key":"66_CR3","unstructured":"E. Cohen and N. Megiddo. Recognizing properties of periodic graphs. The Victor Klee Festschrift, Honorary Volume of Applied Geometry and Discrete Mathematics, 1990."},{"key":"66_CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979."},{"key":"66_CR5","volume-title":"Technical Report 99","author":"F. H\u00f6fting","year":"1992","unstructured":"F. H\u00f6fting and E. Wanke. Minimum cost path in periodic graphs. Technical Report 99, Universit\u00e4t-Gesamthochschule-Paderborn, Paderborn, FRG, April 1992."},{"key":"66_CR6","unstructured":"F. H\u00f6fting and E. Wanke. Polynomial algorithms for minimum cost paths in periodic graphs. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete Algorithms, pages 493\u2013499, 1993."},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"K. Iwano and K. Steiglitz. Testing for cycles in infinite graphs with periodic structure. In Proceedings of Annual ACM Symposium on Theory of Computing '87, pages 46\u201355, 1987.","DOI":"10.1145\/28395.28401"},{"issue":"3","key":"66_CR8","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. M. Karp","year":"1967","unstructured":"R.M. Karp, R.E. Miller, and A. Winograd. The organization of computations for uniform recurrence equations. Journal of the ACM, 14(3):563\u2013590, July 1967.","journal-title":"Journal of the ACM"},{"key":"66_CR9","unstructured":"M. Kodialam and J.B. Orlin. Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming. Proceedings of the second annual ACM-SIAM Symposium on Discrete Algorithms, pages 131\u2013135, 1991."},{"key":"66_CR10","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju and G.F. Sullivan. Detecting cycles in dynamic graphs in polynomial time. In Proceedings of Annual ACM Symposium on Theory of Computing '88, pages 398\u2013406, 1988.","DOI":"10.1145\/62212.62251"},{"key":"66_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/B978-0-12-566780-7.50022-2","volume-title":"Progress in Combinatorial Optimization","author":"J. B. Orlin","year":"1984","unstructured":"J.B. Orlin. Some problems on dynamic\/periodic graphs. In W.R. Pulleyblank, editor, Progress in Combinatorial Optimization, pages 273\u2013293. Academic Press, Orlando, Florida, 1984."},{"key":"66_CR12","unstructured":"S.K. Rao. Regular iterative algorithms and their implementations on processor arrays. PhD thesis, Department of Electrical Engineering, Stanford University, 1985."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:59:35Z","timestamp":1619571575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}