{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:39Z","timestamp":1725664059990},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:41:28Z","timestamp":1330245688000},"page":"70-86","source":"Crossref","is-referenced-by-count":4,"title":["On-line graph algorithms for incremental compilation"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Rohnert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"7_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974."},{"key":"7_CR2","volume-title":"Technical Report Bericht Nr. 77","author":"M. Dietzfelbinger","year":"1991","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. Technical Report Bericht Nr. 77, Fachbereich Mathematik-Informatik, Universit\u00e4t-Gesamthochschule Paderborn, 4790 Paderborn, Germany, January 1991, also presented at FOCS '88."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","volume":"48","author":"G. F. Italiano","year":"1986","unstructured":"G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theoret. Cornput. Sci., 48:273\u2013281, 1986.","journal-title":"Theoret. Cornput. Sci."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(88)90136-6","volume":"28","author":"G. F. Italiano","year":"1988","unstructured":"G. F. Italiano. Finding paths and deleting edges in directed acyclic graphs. Inform. Process. Lett, 28:5\u201311, 1988.","journal-title":"Inform. Process. Lett"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"J. A. La Poutr\u00e9 and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, 314, pages 106\u2013120. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-19422-3_9"},{"key":"7_CR6","unstructured":"J. A. McHugh. Algorithmic Graph Theory. Prentice Hall, 1990."},{"key":"7_CR7","volume-title":"volume 2 of Data Structures and Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Graph Algorithms and NP-Completeness, volume 2 of Data Structures and Algorithms. Springer-Verlag, Berlin Heidelberg New York Tokyo, 1984."},{"key":"7_CR8","first-page":"5","volume":"25","author":"U. Nanni","year":"1991","unstructured":"U. Nanni and P. Terrevoli. A fully dynamic data structure for path expressions on dags. R.A.I.R.O. Theorical Informatics and Applications 25, 5, 1991.","journal-title":"R.A.I.R.O. Theorical Informatics and Applications"},{"key":"7_CR9","volume-title":"Technical Report TR-92-017","author":"S. M. Omohundro","year":"1992","unstructured":"S. M. Omohundro, C. Lim, and J. Bilmes. The sather language compiler\/debugger implementation. Technical Report TR-92-017, International Computer Science Institute, Berkeley, Ca., 1992."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6:306\u2013318, 1985.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"D. M. Yellin. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica, to appear.","DOI":"10.1007\/BF01209711"}],"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-57899-4_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:43Z","timestamp":1605629743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}