000 | 02759nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-68458-9 | ||
003 | DE-He213 | ||
005 | 20160624102049.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1996 gw | s |||| 0|eng d | ||
020 |
_a9783540684589 _9978-3-540-68458-9 |
||
024 | 7 |
_a10.1007/BFb0028290 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aBounded Incremental Computation _h[electronic resource] / _cedited by G. Ramalingam. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1996. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1996. |
|
300 |
_aXII, 196 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1089 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aOperating systems (Computers). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aOperating Systems. |
700 | 1 |
_aRamalingam, G. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540613206 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1089 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0028290 |
942 |
_2EBK7002 _cEBK |
||
999 |
_c36296 _d36296 |