LEADER 03383nam  22006375  450 
001 996465329103316
005 20200705172937.0
010   $a3-540-68458-1
024 7 $a10.1007/BFb0028290
035   $a(CKB)1000000000234465
035   $a(SSID)ssj0000321692
035   $a(PQKBManifestationID)11246333
035   $a(PQKBTitleCode)TC0000321692
035   $a(PQKBWorkID)10280942
035   $a(PQKB)10458615
035   $a(DE-He213)978-3-540-68458-9
035   $a(PPN)15521411X
035   $a(EXLCZ)991000000000234465
100   $a20121227d1996      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aBounded Incremental Computation$b[electronic resource] /$fby G. Ramalingam
205   $a1st ed. 1996.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996.
215   $a1 online resource (XII, 196 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1089
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-61320-X 
327   $aOn 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.
330   $aIncremental 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1089
606   $aAlgorithms
606   $aCombinatorics
606   $aComputers
606   $aOperating systems (Computers)
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045
615  0$aAlgorithms.
615  0$aCombinatorics.
615  0$aComputers.
615  0$aOperating systems (Computers).
615 14$aAlgorithm Analysis and Problem Complexity.
615 24$aCombinatorics.
615 24$aComputation by Abstract Devices.
615 24$aOperating Systems.
676   $a004/.01/5114
700   $aRamalingam$b G$4aut$4http://id.loc.gov/vocabulary/relators/aut$0754223
906   $aBOOK
912   $a996465329103316
996   $aBounded Incremental Computation$92831521
997   $aUNISA