Loading...
Please wait, while we are loading the content...
Similar Documents
◾ Graph Algorithms
| Content Provider | Scilit |
|---|---|
| Author | Ghosh, Sukumar |
| Copyright Year | 2014 |
| Description | An important issue in distributed algorithms for graphs is that of static vs. dynamic topology. e topology is called static when it does not change. A topology that is not static is called dynamic-it is the result of spontaneous addition and deletion of nodes and edges, which reects real-life situations. Clearly, algorithms for dynamic topologies are more robust than those for static topologies only. In this chapter, we will study distributed algorithms for solving a few graph theoretic problems. Book Name: Distributed Systems |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2012-0-00608-2&isbn=9780429192357&doi=10.1201/b17224-14&format=pdf |
| Ending Page | 257 |
| Page Count | 38 |
| Starting Page | 220 |
| DOI | 10.1201/b17224-14 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2014-07-14 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Distributed Systems Hardware and Architecturee Distributed Algorithms |
| Content Type | Text |
| Resource Type | Chapter |