{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T08:43:13Z","timestamp":1771576993183,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00075-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"53-58","source":"Crossref","is-referenced-by-count":36,"title":["Maintaining a topological order under edge insertions"],"prefix":"10.1016","volume":"59","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":"78","reference":[{"key":"10.1016\/0020-0190(96)00075-0_BIB1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","article-title":"Amortized efficiency of a path retrieval data structure","volume":"48","author":"Italiano","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00075-0_BIB2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(88)90136-6","article-title":"Finding paths and deleting edges in directed acyclic graphs","volume":"28","author":"Italiano","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00075-0_BIB3","series-title":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"106","article-title":"Maintenance of transitive closure and transitive reduction of graphs","volume":"314","author":"La Poutr\u00e9","year":"1988"},{"key":"10.1016\/0020-0190(96)00075-0_BIB4","series-title":"Data Structures and Algorithms. Vol. 2. Graph Algorithms and NP-Completeness","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0020-0190(96)00075-0_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/204865.204889","article-title":"LEDA, a platform for combinatorial and geometric computing","volume":"38","author":"Mehlhorn","year":"1995","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/0020-0190(96)00075-0_BIB6","article-title":"A fully dynamic data structure for path expressions on dags","volume":"25","author":"Nanni","year":"1991","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0020-0190(96)00075-0_BIB7","article-title":"The Sather language compiler\/debugger implementation","author":"Omohundro","year":"1992"},{"key":"10.1016\/0020-0190(96)00075-0_BIB8","article-title":"Data Structures and Network Algorithms","volume":"44","author":"Tarjan","year":"1983"},{"key":"10.1016\/0020-0190(96)00075-0_BIB9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/0020-0190(96)00075-0_BIB10","doi-asserted-by":"crossref","unstructured":"D.M. Yellin, Speeding up dynamic transitive closure for bounded degree graphs, Acta Inform., to appear.","DOI":"10.1007\/BF01209711"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000750?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000750?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:02Z","timestamp":1556058242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000750"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00075-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}