{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:32:56Z","timestamp":1794357176342,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":10,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_158","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:59Z","timestamp":1214490959000},"page":"343-344","source":"Crossref","is-referenced-by-count":4,"title":["Fully Dynamic Transitive Closure"],"prefix":"10.1007","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"158_CR1_158","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1059513.1059514","volume":"52","author":"C. Demestrescu","year":"2005","unstructured":"Demestrescu, C., Italiano, G.F.: Trade-offs for fully dynamic transitive closure on DAG's: breaking through the $$ O(n^2) $$ barrier, (presented in FOCS 2000). J.\u00a0ACM 52(2), 147\u2013156 (2005)","journal-title":"J. ACM"},{"issue":"6","key":"158_CR2_158","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C. Demestrescu","year":"2004","unstructured":"Demestrescu, C., Italiano, G.F.: A\u00a0new approach to dynamic all pairs shortest paths, (presented in STOC 2003). J.\u00a0ACM 51(6), 968\u2013992 (2004)","journal-title":"J. ACM"},{"key":"158_CR3_158","doi-asserted-by":"crossref","unstructured":"Frigioni, D., Miller, T., Nanni, U., Zaroliagis, C.D.: An experimental study of dynamic algorithms for transitive closure. ACM\u00a0J Exp. Algorithms 6(9) (2001)","DOI":"10.1145\/945394.945403"},{"key":"158_CR4_158","volume-title":"Proceedings of the 40th Annual IEEE Symposium on Foundation of Computer Science. ComiIEEE FOCS pp. 81\u201391","author":"V. King","year":"1999","unstructured":"King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: Proceedings of the 40th Annual IEEE Symposium on Foundation of Computer Science. ComiIEEE FOCS pp.\u00a081\u201391. IEEE Computer Society, New York (1999)"},{"issue":"1","key":"158_CR5_158","first-page":"150","volume":"65","author":"V. King","year":"2002","unstructured":"King, V., Sagert, G.: A\u00a0fully dynamic algorithm for maintaining the transitive closure, (presented in FOCS 1999). JCCS 65(1), 150\u2013167 (2002)","journal-title":"JCCS"},{"key":"158_CR6_158","doi-asserted-by":"crossref","unstructured":"King, V., Thorup, M.: A\u00a0space saving trick for dynamic transitive closure and shortest path algorithms. In: Proceedings of the 7th Annual International Conference of Computing and Cominatorics, vol. 2108\/2001, pp. 269\u2013277. Lect. Notes Comp. Sci. COCOON Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44679-6_30"},{"key":"158_CR7_158","first-page":"404","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM IEEE SODA","author":"L. Roditty","year":"2003","unstructured":"Roditty, L.: A\u00a0faster and simpler fully dynamic transitive closure. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM IEEE SODA, pp.\u00a0404\u2013412. ACM, Baltimore (2003)"},{"key":"158_CR8_158","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. In: Proceedings of the 43rd Annual Symposium on Foundation of Computer Science. IEEE FOCS, pp. 679\u2013688 IEEE Computer Society, Vancouver, Canada (2002)","DOI":"10.1109\/SFCS.2002.1181993"},{"key":"158_CR9_158","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: A\u00a0fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proceedings of the 36th ACM Symposium on Theory of Computing. ACM STOC, pp. 184\u2013191 ACM, Chicago (2004)","DOI":"10.1145\/1007352.1007387"},{"key":"158_CR10_158","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/FOCS.2004.25","volume-title":"FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)","author":"P. Sankowski","year":"2004","unstructured":"Sankowski, S.: Dynamic transitive closure via dynamic matrix inverse. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science. IEEE FOCS, 509\u2013517, IEEE Computer Society, Rome, Italy (2004)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:29Z","timestamp":1738254749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_158"}},"subtitle":["1999; King"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_158","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}