<電子ブック>
Bounded Incremental Computation / by G. Ramalingam
(Lecture Notes in Computer Science. ISSN:16113349 ; 1089)
版 | 1st ed. 1996. |
---|---|
出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
出版年 | 1996 |
本文言語 | 英語 |
大きさ | XII, 196 p : online resource |
著者標目 | *Ramalingam, G author SpringerLink (Online service) |
件 名 | LCSH:Algorithms LCSH:Discrete mathematics LCSH:Computer science LCSH:Operating systems (Computers) FREE:Algorithms FREE:Discrete Mathematics FREE:Theory of Computation FREE:Operating Systems |
一般注記 | 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 HTTP:URL=https://doi.org/10.1007/BFb0028290 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540684589 |
|
電子リソース |
|
EB00225902 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA76.9.A43 DC23:518.1 |
書誌ID | 4001090676 |
ISBN | 9783540684589 |