Isbn: 9781447151722 - distributed graph algorithms for computer networks (17 risultati)

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: New.

Condizione: New. In English.

Condizione: New.

Buch. Condizione: 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.…

Condizione: New. pp. 344.

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

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 344 pp. Englisch.…

Condizione: new. Questo è un articolo print on demand.

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents a comprehensive review of key distributed graph algorithms for computer network applicationsDescribes in detail the implementation of each algorithm, and discusses their concrete network applicationsIncludes practical exercises at .…

Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Condizione: New. Print on Demand pp. 344 167 Illus.

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 KG, Sachsenplatz 4-6, 1201 Wien 344 pp. Englisch.…

Condizione: New. PRINT ON DEMAND pp. 344.