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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 15,90 expédition depuis Allemagne vers France
Destinations, frais et délaisEUR 2,84 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : Studibuch, Stuttgart, Allemagne
hardcover. Etat : Gut. 342 Seiten; 9781447151722.3 Gewicht in Gramm: 1. N° de réf. du vendeur 839156
Quantité disponible : 1 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-10244
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 344. N° de réf. du vendeur 2697535354
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : 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 . N° de réf. du vendeur 4185178
Quantité disponible : Plus de 20 disponibles
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 344 167 Illus. N° de réf. du vendeur 94894757
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 344. N° de réf. du vendeur 1897535344
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9781447151722
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781447151722_new
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9781447151722
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9781447151722
Quantité disponible : 1 disponible(s)