03383nam 22006375 450 99646532910331620200705172937.03-540-68458-110.1007/BFb0028290(CKB)1000000000234465(SSID)ssj0000321692(PQKBManifestationID)11246333(PQKBTitleCode)TC0000321692(PQKBWorkID)10280942(PQKB)10458615(DE-He213)978-3-540-68458-9(PPN)15521411X(EXLCZ)99100000000023446520121227d1996 u| 0engurnn|008mamaatxtccrBounded Incremental Computation[electronic resource] /by G. Ramalingam1st ed. 1996.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1996.1 online resource (XII, 196 p.) Lecture Notes in Computer Science,0302-9743 ;1089Bibliographic Level Mode of Issuance: Monograph3-540-61320-X On incremental algorithms and their complexity -- Terminology and notation -- Incremental algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental algorithm for a generalization of the shortest-path problem -- Incremental algorithms for the circuit value annotation problem -- Inherently unbounded incremental computation problems -- Incremental algorithms for reducible flowgraphs -- Conclusions.Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.Lecture Notes in Computer Science,0302-9743 ;1089AlgorithmsCombinatoricsComputersOperating systems (Computers)Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Algorithms.Combinatorics.Computers.Operating systems (Computers).Algorithm Analysis and Problem Complexity.Combinatorics.Computation by Abstract Devices.Operating Systems.004/.01/5114Ramalingam Gauthttp://id.loc.gov/vocabulary/relators/aut754223BOOK996465329103316Bounded Incremental Computation2831521UNISA