skip to content
Distributed graph algorithms for computer networks Preview this item
ClosePreview this item
Checking...

Distributed graph algorithms for computer networks

Author: K Erciyes
Publisher: London ; New York : Springer, ©2013.
Series: Computer communications and networks.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Database:WorldCat
Summary:
Graph theory is an invaluable tool for the designer of algorithms for distributed systems. This hands-on 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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Original print version: Erciyes, K.
Distributed graph algorithms for computer networks.
London : Springer, [2013]
(OCoLC)830945897
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: K Erciyes
ISBN: 9781447151739 1447151739
OCLC Number: 844952121
Description: 1 online resource (xviii, 324 pages) : illustrations
Contents: Fundamental Algorithms. Graphs --
The Computational Model --
Spanning Tree Construction --
Graph Traversals --
Minimum Spanning Trees --
Routing --
Self-Stabilization --
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.
Series Title: Computer communications and networks.
Responsibility: K. Erciyes.
More information:

Abstract:

Graph theory is an invaluable tool for the designer of algorithms for distributed systems. This hands-on 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 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 This classroom-tested and easy-to-follow 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.

Reviews

Editorial reviews

Publisher Synopsis

From 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 Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/844952121>
library:oclcnum"844952121"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/844952121>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:copyrightYear"2013"
schema:creator
schema:datePublished"2013"
schema:description"Graph theory is an invaluable tool for the designer of algorithms for distributed systems. This hands-on 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 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 This classroom-tested and easy-to-follow 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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1372592797>
schema:genre"Electronic books."@en
schema:inLanguage"en"
schema:name"Distributed graph algorithms for computer networks"@en
schema:publisher
schema:url<http://dx.doi.org/10.1007/978-1-4471-5173-9>
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.