{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:14:31Z","timestamp":1737609271108,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654520"},{"type":"electronic","value":"9783540492573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49257-7_23","type":"book-chapter","created":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T02:44:59Z","timestamp":1194662699000},"page":"365-382","source":"Crossref","is-referenced-by-count":1,"title":["Incremental FO( +, < ) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions"],"prefix":"10.1007","author":[{"given":"Chaoyi","family":"Pang","sequence":"first","affiliation":[]},{"given":"Ramamohanarao","family":"Kotagiri","sequence":"additional","affiliation":[]},{"given":"Guozhu","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(92)90267-J","volume":"95","author":"G. Ausiello","year":"1992","unstructured":"G. Ausiello, G. F. Italiano, A. M. Spaccamela, and U. Nanni. On-line computation of minimal and maximal length path. Theor.Comput.Sci., Elsevier Science Publisher, 95,2:245\u2013261, 1992.","journal-title":"Theor.Comput.Sci., Elsevier Science Publisher"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"J. A. Blakeley, P.-A. Larson, and F. W. Tompa. Efficiently updating materialized views. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 61\u201371, 1986.","DOI":"10.1145\/16894.16861"},{"key":"23_CR3","unstructured":"A. L. Buchsbaum, P. C. Kanellakis, and J. S. Vitter. A data structure for arc insertion and regular path finding. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 1990."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Hristo N. Djidjev, Grammati E. Pantziou, and Christos D. Zaroliagis. On-line and dynamic algorithms for shortest path problems. In STACS: Annual Symposium on Theoretical Aspects of Computer Science, 1995.","DOI":"10.1007\/3-540-59042-0_73"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0020-0190(97)00066-5","volume":"62","author":"G. Dong","year":"1997","unstructured":"G. Dong and C. Pang. Maintaining transitive closure in first-order after node-set and edge-set deletions. Information Processing Letters, 62(3):193\u2013199, 1997.","journal-title":"Information Processing Letters"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"G. Dong and J. Su. Space bounded FOIES. In Proc. of the ACM Symposium on Principles of Database Systems, pages 139\u2013150, mtMay 1995.","DOI":"10.1145\/212433.220204"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"G. Dong and R. Topor. Incremental evaluation of datalog queries. In Proc. Int\u2019l Conference on Database Theory, pages 282\u2013296, Berlin, Germany, October 1992.","DOI":"10.1007\/3-540-56039-4_48"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Guozhu Dong and Ramamohanarao Kotagiri. Incrementally evaluating constrained transitive closure by conjunctive querie. In International Conference on Deductive and Object-Oriented Databases, 1997.","DOI":"10.1007\/3-540-63792-3_7"},{"key":"23_CR9","first-page":"371","volume":"49","author":"S. Even","year":"1985","unstructured":"S. Even and H. Gazit. Updating distances in dynamic graphs. Methods of Operations Research, 49:371\u2013387, 1985.","journal-title":"Methods of Operations Research"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0304-3975(93)90328-Q","volume":"116","author":"E. Feuerstein","year":"1993","unstructured":"E. Feuerstein and A. Marchetti-Spaccamela. Dynamic algorithms for shortest paths in planar graphs. Theoretical Computer Science, 116(2):359\u2013371, 1993.","journal-title":"Theoretical Computer Science"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"S. Grumbach and J. Su. First-order definability over constraint databases. In Proceedings of Conference on Constraint Programming, 1995.","DOI":"10.1007\/3-540-60299-2_8"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Philip N. Klein, Satish Rao, Monika H. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In Proc. 26th Symp. Theory of Computing, pages 27\u201337. Assoc. for Computing Machinery, 1994.","DOI":"10.1145\/195058.195092"},{"key":"23_CR13","unstructured":"Chaoyi Pang. Incremental Maintenance Reachability of Graph in First-order and Its extension. PhD thesis, The University of Melbourne, 1999."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sushant Patnaik and Neil Immerman. Dyn-FO: A parallel dynamic complexity class. In Proc. ACM Symp. on Principles of Database Systems, pages 210\u2013221, 1994.","DOI":"10.1145\/182591.182614"},{"key":"23_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0028290","volume-title":"Bounded Incremental Computation","author":"G. Ramalingam","year":"1996","unstructured":"G. Ramalingam. Bounded Incremental Computation. LNCS 1089, 1996."},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/971697.602293","volume":"14","author":"O. Shmueli","year":"1984","unstructured":"O. Shmueli and A. Itai. Maintenance of views. In Sigmod Record, volume 14(2), pages 240\u2013255, 1984.","journal-title":"Sigmod Record"},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0204032","volume":"3","author":"P.M.N. Spira","year":"1975","unstructured":"P.M.N. Spira and A. Pan. On finding and updating spanning trees and shortest paths. SIAM Journal on Computing, 3(4):375\u2013380, September 1975.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49257-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:57:46Z","timestamp":1737525466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49257-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540654520","9783540492573"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49257-7_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}