Vai al contenuto principale della pagina
Creatore: 
Erciyes, K.

Titolo: 
Distributed graph algorithms for computer networks [electronic resource] / K. Erciyes

Link to work: 
Distributed Graph Algorithms for Computer Networks

Pubblicazione:  London ; New York : Springer, c2013 
Estensione:  1 online resource. 
Disciplina:  518/.1 
Titolo uniforme di collana:  Computer communications and networks. 
Genere/Forma:  Electronic books 
Index termUncontrolled:  Computer science 
Computer Communication Networks  
Computer software  
Algorithm Analysis and Problem Complexity  
Math Applications in Computer Science  
Soggetto non controllato:  Computer science 
Computer Communication Networks  
Computer software  
Algorithm Analysis and Problem Complexity  
Math Applications in Computer Science  
Termine d'indicizzazioneOccupazione:  Computer science 
Computer Communication Networks  
Computer software  
Algorithm Analysis and Problem Complexity  
Math Applications in Computer Science  
Contenuto supplementare:  Includes bibliographical references and index. 
Nota di contenuto:  Fundamental Algorithms. Graphs  The Computational Model  Spanning Tree Construction  Graph Traversals  Minimum Spanning Trees  Routing  SelfStabilization  Graph Theoretical Algorithms. Vertex Coloring  Maximal Independent Sets  Dominating Sets  Matching  Vertex Cover  Ad Hoc Wireless Networks. Introduction  Topology Control  Ad Hoc Routing  Sensor Network Applications  ASSIST: A Simulator to Develop Distributed Algorithms. 
Sommario/riassunto:  Graph theory is an invaluable tool for the designer of algorithms for distributed systems. This handson textbook/reference presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Each chapter opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis. The chapters then conclude with summarizing notes and programming exercises. Topics and features: Introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and selfstabilization Reviews graphtheoretical 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 graphtheoretical 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 This classroomtested and easytofollow textbook is essential reading for all graduate students and researchers interested in discrete mathematics, algorithms and computer networks. Prof. Dr. Kayhan Erciyeş is the Rector and a member of the Computer Engineering Department at Izmir University, Turkey. 
Collana:  Computer communications and networks, 16177975 
ISBN:  9781447151739 (electronic bk.) 
1447151739 (electronic bk.)  
9781447151722  
Formato:  Materiale a stampa 
Livello bibliografico  Monografia 
Lingua di pubblicazione:  Inglese 
Record Nr.:  9851128 
Localizzazioni e accesso elettronico  http://dx.doi.org/10.1007/9781447151739 
Lo trovi qui:  University of Chicago 
Item:  Permalink to OPAC 