distributed graph algorithms computer von erciyes kayhan (9 Ergebnisse)

hardcover. Zustand: Gut. 342 Seiten; 9781447151722.3 Gewicht in Gramm: 1.

Zustand: New. pp. 344 167 Illus.

Paperback. Zustand: Brand New. 342 pages. 9.25x6.10x0.78 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 344 pp. Englisch.

Taschenbuch. Zustand: Neu. Distributed Graph Algorithms for Computer Networks | Kayhan Erciyes | Taschenbuch | xviii | Englisch | 2015 | Springer London | EAN 9781447158509 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.

Buch. Zustand: Neu. Neuware -RezensionFrom the reviews:'This beautiful and timely book provides a comprehensive review of key distributed graph algorithms for computer network applications. a must-read for young students and researchers who want to master the topics and implement applications. This would be an excellent textbook for courses on distributed systems. I highly recommend it to researchers and students of computer networks, and it will also provide a solid foundation for many upcoming areas of research, such as network coding for distributed storage systems.' (Manish Gupta, Computing Reviews, February, 2014)Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 344 pp. Englisch.

Hardcover. Zustand: Brand New. 324 pages. 9.25x6.25x0.80 inches. In Stock.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.