{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:29:57Z","timestamp":1781195397271,"version":"3.54.1"},"reference-count":47,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00079-8","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"233-277","source":"Crossref","is-referenced-by-count":176,"title":["On the computational complexity of dynamic graph problems"],"prefix":"10.1016","volume":"158","author":[{"given":"G.","family":"Ramalingam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00079-8_BIB1","series-title":"Proc. of the First Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"32","article-title":"Incremental evaluation of computational circuits","author":"Alpern","year":"1990"},{"key":"10.1016\/0304-3975(95)00079-8_BIB2","series-title":"Proc. of the First Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"12","article-title":"Incremental algorithms for minimal length paths","author":"Ausiello","year":"1990"},{"key":"10.1016\/0304-3975(95)00079-8_BIB3","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/BF00259471","article-title":"Proving relative lower bounds for incremental algorithms","volume":"27","author":"Berman","year":"1990","journal-title":"Acta Informatica"},{"key":"10.1016\/0304-3975(95)00079-8_BIB4","series-title":"Conf. Record of the Fourteenth ACM Symp. on Principles of Programming Languages","first-page":"85","article-title":"Binding performance at language design time","author":"Cai","year":"1987"},{"key":"10.1016\/0304-3975(95)00079-8_BIB5","series-title":"Proc. of the Second Internat. Conf. on Algebraic Methodology and Software Technology (AMAST)","article-title":"Languages polynomial in the input plus output","author":"Cai","year":"1991"},{"key":"10.1016\/0304-3975(95)00079-8_BIB6","series-title":"Conf. Record of the Fifteenth ACM Symp. on Principles of Programming Languages","first-page":"274","article-title":"Incremental data flow update via attribute and dominator updates","author":"Carroll","year":"1988"},{"key":"10.1016\/0304-3975(95)00079-8_BIB7","article-title":"Data flow update via dominator and attribute updates","author":"Carroll","year":"1988"},{"key":"10.1016\/0304-3975(95)00079-8_BIB8","article-title":"Incremental algorithms in graph theory","author":"Cheston","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(95)00079-8_BIB9","first-page":"178","article-title":"Graph property update algorithms and their application to distance matrices","volume":"20","author":"Cheston","year":"1982","journal-title":"INFOR"},{"key":"10.1016\/0304-3975(95)00079-8_BIB10","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"issue":"2","key":"10.1016\/0304-3975(95)00079-8_BIB11","first-page":"132","article-title":"Etude et extension d'un algorithme de Murchland","volume":"16","author":"Dionne","year":"1978","journal-title":"INFOR"},{"key":"10.1016\/0304-3975(95)00079-8_BIB12","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","article-title":"Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation","volume":"31","author":"Driscoll","year":"1988","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(95)00079-8_BIB13_1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00079-8_BIB13_2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01934460","article-title":"On incremental evaluation of ordered attributed grammars","volume":"23","author":"Yeh","year":"1983","journal-title":"BIT"},{"issue":"1","key":"10.1016\/0304-3975(95)00079-8_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322234.322235","article-title":"An on-line edge-deletion problem","volume":"28","author":"Even","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00079-8_BIB15","series-title":"IX Symp. on Operations Research","first-page":"271","article-title":"Updating distances in dynamic graphs","volume":"Vol. 49","author":"Even","year":"1985"},{"issue":"4","key":"10.1016\/0304-3975(95)00079-8_BIB16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/net.3230080406","article-title":"A new shortest path updating algorithm","volume":"8","author":"Goto","year":"1978","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0304-3975(95)00079-8_BIB17","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.2307\/2274767","article-title":"Time polynomial in input or output","volume":"54","author":"Gurevich","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00079-8_BIB18","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/trsc.4.1.36","article-title":"The method of competing links","volume":"4","author":"Halder","year":"1970","journal-title":"Transportation Sci."},{"key":"10.1016\/0304-3975(95)00079-8_BIB19","article-title":"Incremental graph evaluation","author":"Hoover","year":"1987"},{"key":"10.1016\/0304-3975(95)00079-8_BIB20","series-title":"Proc. IEEE Internat. Conf. on Communications","first-page":"38.14","article-title":"Constrained routing in large sparse networks","author":"Hsieh","year":"1976"},{"issue":"4","key":"10.1016\/0304-3975(95)00079-8_BIB21","first-page":"470","article-title":"On the dynamic shortest path problem","volume":"13","author":"Lin","year":"1990","journal-title":"J. Inform. Process."},{"key":"10.1016\/0304-3975(95)00079-8_BIB22","first-page":"96","article-title":"A network evaluation procedure","volume":"205","author":"Loubal","year":"1967","journal-title":"Highway Res. Record"},{"key":"10.1016\/0304-3975(95)00079-8_BIB23","article-title":"Data flow analysis and incremental iteration","author":"Marlowe","year":"1989"},{"key":"10.1016\/0304-3975(95)00079-8_BIB24","series-title":"Conf. Record of the Seventeenth ACM Symp. on Principles of Programming Languages","first-page":"184","article-title":"An efficient hybrid algorithm for incremental data flow analysis","author":"Marlowe","year":"1990"},{"key":"10.1016\/0304-3975(95)00079-8_BIB25","article-title":"The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph","author":"Murchland","year":"1967"},{"key":"10.1016\/0304-3975(95)00079-8_BIB26","unstructured":"J.D. Murchland, A fixed matrix method for all shortest distances in a directed graph and for the inverse problem, Doctoral dissertation, Universit\u00e4t Karlsruhe, W. Germany."},{"key":"10.1016\/0304-3975(95)00079-8_BIB27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02253338","article-title":"Netzwerk-veraenderungen und korrektur kuerzester weglaengen von einer wurzelmenge zu allen anderen knoten","volume":"12","author":"Pape","year":"1974","journal-title":"Computing"},{"key":"10.1016\/0304-3975(95)00079-8_BIB28","article-title":"On the computational complexity of incremental algorithms","author":"Ramalingam","year":"1991"},{"key":"10.1016\/0304-3975(95)00079-8_BIB29","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0028290","article-title":"Bounded incremental computation","author":"Ramalingam","year":"1993"},{"issue":"1","key":"10.1016\/0304-3975(95)00079-8_BIB30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90095-0","article-title":"A topological approach to dynamic graph connectivity","volume":"25","author":"Reif","year":"1987","journal-title":"Informat. Process. Lett."},{"key":"10.1016\/0304-3975(95)00079-8_BIB31","series-title":"Conf. Record of the Ninth ACM Symp. on Principles of Programming Languages","first-page":"169","article-title":"Optimal-time incremental semantic analysis for syntax-directed editors","author":"Reps","year":"1982"},{"issue":"3","key":"10.1016\/0304-3975(95)00079-8_BIB32","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2166.357218","article-title":"Incremental context-dependent analysis for language-based editors","volume":"5","author":"Reps","year":"1983","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/0304-3975(95)00079-8_BIB33","series-title":"Generating Language-Based Environments","author":"Reps","year":"1984"},{"key":"10.1016\/0304-3975(95)00079-8_BIB34","series-title":"Conf. Record of the Thirteenth ACM Symp. on Principles of Programming Languages","article-title":"Remote attribute updating for language-based editors","author":"Reps","year":"1986"},{"key":"10.1016\/0304-3975(95)00079-8_BIB35","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00263583","article-title":"Incremental evaluation for attribute grammars with unrestricted movement between tree modifications","volume":"25","author":"Reps","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(95)00079-8_BIB36","series-title":"The Synthesizer Generator: A System for Constructing Language-Based Editors","author":"Reps","year":"1988"},{"issue":"5","key":"10.1016\/0304-3975(95)00079-8_BIB37","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0041-5553(68)90148-1","article-title":"The parametric problem of shortest distances","volume":"8","author":"Rodionov","year":"1968","journal-title":"U.S.S.R. Comput. Math. Math. Phys."},{"key":"10.1016\/0304-3975(95)00079-8_BIB38","series-title":"Proc. of STACS 85: Second Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"279","article-title":"A dynamization of the all pairs least cost path problem","volume":"Vol. 182","author":"Rohnert","year":"1985"},{"key":"10.1016\/0304-3975(95)00079-8_BIB39","series-title":"Conf. Record of the Eighth ACM Symp. on Principles of Programming Languages","first-page":"117","article-title":"Linear cost is sometimes quadratic","author":"Rosen","year":"1981"},{"issue":"1","key":"10.1016\/0304-3975(95)00079-8_BIB40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/42192.42193","article-title":"Incremental data flow analysis algorithms","volume":"10","author":"Ryder","year":"1988","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"10.1016\/0304-3975(95)00079-8_BIB41","doi-asserted-by":"crossref","DOI":"10.1109\/32.44377","article-title":"Profiling an incremental data flow analysis algorithm","volume":"SE-16","author":"Ryder","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0304-3975(95)00079-8_BIB42","first-page":"129","article-title":"Algorithms","author":"Sedgewick","year":"1983"},{"issue":"3","key":"10.1016\/0304-3975(95)00079-8_BIB43","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","article-title":"On finding and updating spanning trees and shortest paths","volume":"4","author":"Spira","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00079-8_BIB44","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0304-3975(95)00079-8_BIB45","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01934460","article-title":"On incremental evaluation of ordered attributed grammars","volume":"23","author":"Yeh","year":"1983","journal-title":"BIT"},{"key":"10.1016\/0304-3975(95)00079-8_BIB46","series-title":"Proc. of the SIGPLAN 84 Symp. on Compiler Construction","first-page":"132","article-title":"Incremental data flow analysis in a structured program editor","volume":"19","author":"Zadeck","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000798?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000798?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T14:21:42Z","timestamp":1580826102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595000798"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00079-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}