跳至内容
Distributed graph algorithms for computer networks 線上預覽
關閉線上預覽
正在查...

Distributed graph algorithms for computer networks

作者: K Erciyes
出版商: London ; New York : Springer, ©2013.
叢書: Computer communications and networks.
版本/格式:   電子書 : 文獻 : 英語所有版本和格式的總覽
資料庫:WorldCat
提要:
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  再讀一些...
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在線上查詢

與資料的連結

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

類型/形式: Electronic books
其他的實體格式: Original print version: Erciyes, K.
Distributed graph algorithms for computer networks.
London : Springer, [2013]
(OCoLC)830945897
資料類型: 文獻, 網際網路資源
文件類型: 網路資源, 電腦資料
所有的作者/貢獻者: K Erciyes
ISBN: 9781447151739 1447151739
OCLC系統控制編碼: 844952121
描述: 1 online resource (xviii, 324 pages) : illustrations
内容: 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.
叢書名: Computer communications and networks.
責任: K. Erciyes.
更多資訊:

摘要:

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.

評論

社評

出版商概要

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 再讀一些...

 
讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


Primary Entity

<http://www.worldcat.org/oclc/844952121> # Distributed graph algorithms for computer networks
    a schema:Book, schema:MediaObject, schema:CreativeWork ;
    library:oclcnum "844952121" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
    library:placeOfPublication <http://dbpedia.org/resource/London> ; # London
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Thing/computer_science> ; # Computer science.
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Thing/algorithm_analysis_and_problem_complexity> ; # Algorithm Analysis and Problem Complexity.
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Topic/algorithms> ; # Algorithms
    schema:about <http://id.worldcat.org/fast/872327> ; # Computer networks--Mathematics
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Thing/computer_communication_networks> ; # Computer Communication Networks.
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Topic/computer_communication_networks> ; # Computer Communication Networks
    schema:about <http://dewey.info/class/518.1/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Thing/math_applications_in_computer_science> ; # Math Applications in Computer Science.
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Topic/mathematics> ; # Mathematics
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Topic/computer_networks_mathematics> ; # Computer networks--Mathematics
    schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Thing/computer_software> ; # Computer software.
    schema:about <http://id.worldcat.org/fast/946581> ; # Graph algorithms
    schema:author <http://viaf.org/viaf/305201611> ; # K. Erciyes
    schema:bookFormat schema:EBook ;
    schema:copyrightYear "2013" ;
    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:isPartOf <http://experiment.worldcat.org/entity/work/data/1372592797#Series/computer_communications_and_networks> ; # Computer communications and networks.
    schema:isPartOf <http://worldcat.org/issn/1617-7975> ; # Computer communications and networks,
    schema:isSimilarTo <http://www.worldcat.org/oclc/830945897> ;
    schema:name "Distributed graph algorithms for computer networks"@en ;
    schema:productID "844952121" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/844952121#PublicationEvent/london_new_york_springer_c2013> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1372592797#Agent/springer> ; # Springer
    schema:url <http://dx.doi.org/10.1007/978-1-4471-5173-9> ;
    schema:workExample <http://dx.doi.org/10.1007/978-1-4471-5173-9> ;
    schema:workExample <http://worldcat.org/isbn/9781447151739> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/844952121> ;
    .


Related Entities

<http://dbpedia.org/resource/London> # London
    a schema:Place ;
    schema:name "London" ;
    .

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Series/computer_communications_and_networks> # Computer communications and networks.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/844952121> ; # Distributed graph algorithms for computer networks
    schema:name "Computer communications and networks." ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Thing/algorithm_analysis_and_problem_complexity> # Algorithm Analysis and Problem Complexity.
    a schema:Thing ;
    schema:name "Algorithm Analysis and Problem Complexity." ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Thing/computer_communication_networks> # Computer Communication Networks.
    a schema:Thing ;
    schema:name "Computer Communication Networks." ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Thing/computer_science> # Computer science.
    a schema:Thing ;
    schema:name "Computer science." ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Thing/computer_software> # Computer software.
    a schema:Thing ;
    schema:name "Computer software." ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Thing/math_applications_in_computer_science> # Math Applications in Computer Science.
    a schema:Thing ;
    schema:name "Math Applications in Computer Science." ;
    .

<http://experiment.worldcat.org/entity/work/data/1372592797#Topic/computer_communication_networks> # Computer Communication Networks
    a schema:Intangible ;
    schema:name "Computer Communication Networks"@en ;
    .

<http://id.worldcat.org/fast/872327> # Computer networks--Mathematics
    a schema:Intangible ;
    schema:name "Computer networks--Mathematics"@en ;
    .

<http://id.worldcat.org/fast/946581> # Graph algorithms
    a schema:Intangible ;
    schema:name "Graph algorithms"@en ;
    .

<http://viaf.org/viaf/305201611> # K. Erciyes
    a schema:Person ;
    schema:familyName "Erciyes" ;
    schema:givenName "K." ;
    schema:name "K. Erciyes" ;
    .

<http://worldcat.org/isbn/9781447151739>
    a schema:ProductModel ;
    schema:description "electronic bk." ;
    schema:isbn "1447151739" ;
    schema:isbn "9781447151739" ;
    .

<http://worldcat.org/issn/1617-7975> # Computer communications and networks,
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/844952121> ; # Distributed graph algorithms for computer networks
    schema:issn "1617-7975" ;
    schema:name "Computer communications and networks," ;
    .

<http://www.worldcat.org/oclc/830945897>
    a schema:CreativeWork ;
    rdfs:label "Distributed graph algorithms for computer networks." ;
    schema:description "Original print version: Erciyes, K." ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/844952121> ; # Distributed graph algorithms for computer networks
    .


Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.