{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:47Z","timestamp":1725747347730},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410352"},{"type":"electronic","value":"9783642410369"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41036-9_5","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T05:49:49Z","timestamp":1378187389000},"page":"45-45","source":"Crossref","is-referenced-by-count":0,"title":["The Dynamic Complexity of the Reachability Problem on Graphs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Schwentick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1995.1102","volume":"120","author":"G. Dong","year":"1995","unstructured":"Dong, G., Su, J.: Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput.\u00a0120(1), 101\u2013106 (1995)","journal-title":"Inf. Comput."},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2287718.2287719","volume":"13","author":"W. Gelade","year":"2012","unstructured":"Gelade, W., Marquardt, M., Schwentick, T.: The dynamic complexity of formal languages. ACM Trans. Comput. Log.\u00a013(3), 19 (2012)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jcss.1997.1520","volume":"55","author":"S. Patnaik","year":"1997","unstructured":"Patnaik, S., Immerman, N.: Dyn-fo: A parallel, dynamic complexity class. J. Comput. Syst. Sci.\u00a055(2), 199\u2013209 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Zeume, T., Schwentick, T.: On the quantifier-free dynamic complexity of reachability. CoRR, abs\/1306.3056 (2013)","DOI":"10.1007\/978-3-642-40313-2_73"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41036-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T21:15:31Z","timestamp":1558041331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41036-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410352","9783642410369"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41036-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}