Sorry, you do not have access to this eBook
A subscription is required to access the full text content of this book.
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 decades 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.
A subscription is required to access the full text content of this book.
Other ways to access this content: