{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:55:58Z","timestamp":1771505758535,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540194224","type":"print"},{"value":"9783540392644","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19422-3_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:09:39Z","timestamp":1330200579000},"page":"106-120","source":"Crossref","is-referenced-by-count":30,"title":["Maintenance of transitive closures and transitive reductions of graphs"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Poutr\u00e9","sequence":"first","affiliation":[]},{"given":"J.","family":"Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A.V. Aho","year":"1972","unstructured":"A.V. Aho, M.R. Garey and J.D. Ullman, The transitive reduction of a directed graph, SIAM Journal of Computing, vol. 1, no. 2 (June 1972) 131\u2013137.","journal-title":"SIAM Journal of Computing"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(83)90033-9","volume":"16","author":"T. Ibaraki","year":"1983","unstructured":"T. Ibaraki and N. Katoh, On-line computation of transitive closures of graphs, Information Processing Letters 16 (1983) 95\u201397.","journal-title":"Information Processing Letters"},{"key":"9_CR3","unstructured":"J.A. La Poutr\u00e9 and J. van Leeuwen, Maintenance of transitive closures and transitive reductions of graphs, Technical Report RUU-CS-87-25, Dept. of Computer Science, University of Utrecht."},{"key":"9_CR4","unstructured":"J.A. La Poutr\u00e9 and J. van Leeuwen, in preparation."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BFb0024016","volume":"182","author":"H. Rohnert","year":"1985","unstructured":"H. Rohnert, A dynamization of the all pairs least cost path problem, Lecture Notes in Computer Science 182 (1985) 279\u2013286.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19422-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:20:59Z","timestamp":1619558459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19422-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194224","9783540392644"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-19422-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]}}}