Dynamic Graph Algorithms
 |
|
Описание:
In many applications of graph algorithms, including communication networks, graphics, assembly planning, and VLSI design, graphs are subject to discrete changes, such as additions or deletions of edges or vertices. In the last decade there has been a growing interest in such dynamically changing graphs, and a whole body of algorithms and data structures for dynamic graphs has been discovered. This chapter is intended as an overview of this field.In a typical dynamic graph problem one would like to answer queries on graphs that are undergoing a sequence of updates, for instance, insertions and deletions of edges and vertices. The goal of a dynamic graph algorithm is to update efficiently the solution of a problem after dynamic changes, rather than having to recompute it from scratch each time. Given their powerful versatility, it is not surprising that dynamic algorithms and dynamic data structures are often more difficult to design and analyze than their static counterparts.Похожие книги
| Threshold Graphs and Related Topics Автор: Peled U. N., Mahadev N. V. Год: 1995 |
| Randomized techniques in combinatorial algorithms Автор: Zito M.A.A. Год: 1999 |
 | Threshold Graphs and Related Topics Автор: Mahadev N.V.R.,Peled U.N. Год: 1995 |
| Threshold Graphs and Related Topics, Volume 56 (Annals of Discrete Mathematics) Автор: N.V.R. Mahadev, U.N. Peled Год: 1995 |
 | The Grobner Annihilator Graph of a Ring Автор: Trevor McGuire Год: 2010 |