컨텐츠로 이동
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
Ebook
추가적인 물리적 형식: Print version:
Erciyes, K.
Distributed graph algorithms for computer networks.
London ; New York : Springer, ©2013 Erciyes, K.
(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 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


Primary Entity

<http://www.worldcat.org/oclc/844952121> # Distributed graph algorithms for computer networks
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
   library:oclcnum "844952121" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
   library:placeOfPublication <http://dbpedia.org/resource/London> ; # London
   library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
   schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Topic/algorithms> ; # Algorithms
   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_communication_networks> ; # Computer Communication Networks.
   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#Thing/computer_software> ; # Computer software.
   schema:about <http://experiment.worldcat.org/entity/work/data/1372592797#Topic/mathematics> ; # Mathematics
   schema:about <http://dewey.info/class/518.1/e23/> ;
   schema:about <http://id.worldcat.org/fast/872327> ; # Computer networks--Mathematics
   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/computer_communication_networks> ; # Computer Communication Networks
   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 "Ebook"@en ;
   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_2013> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/1372592797#Agent/springer> ; # Springer
   schema:url <http://www.books24x7.com/marc.asp?bookid=76977> ;
   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: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 "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/844952121> ; # Distributed graph algorithms for computer networks
    .


Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.