LEADER 04959nam 22007215 450 001 9910741142203321 005 20200630155858.0 010 $a1-4471-5173-9 024 7 $a10.1007/978-1-4471-5173-9 035 $a(CKB)3280000000007692 035 $a(EBL)1316985 035 $a(OCoLC)854975572 035 $a(SSID)ssj0000897354 035 $a(PQKBManifestationID)11515840 035 $a(PQKBTitleCode)TC0000897354 035 $a(PQKBWorkID)10902108 035 $a(PQKB)10446976 035 $a(DE-He213)978-1-4471-5173-9 035 $a(MiAaPQ)EBC6314892 035 $a(MiAaPQ)EBC1316985 035 $a(Au-PeEL)EBL1316985 035 $a(CaPaEBR)ebr10976244 035 $a(PPN)170487156 035 $a(EXLCZ)993280000000007692 100 $a20130517d2013 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Graph Algorithms for Computer Networks /$fby Kayhan Erciyes 205 $a1st ed. 2013. 210 1$aLondon :$cSpringer London :$cImprint: Springer,$d2013. 215 $a1 online resource (327 p.) 225 1 $aComputer Communications and Networks,$x1617-7975 300 $aDescription based upon print version of record. 311 $a1-4471-5850-4 311 $a1-4471-5172-0 320 $aIncludes bibliographical references and index. 327 $aIntroduction -- Part I: Fundamental Algorithms -- Graphs -- The Computational Model -- Spanning Tree Construction -- Graph Traversals -- Minimal Spanning Trees -- Routing -- Self-Stabilization -- Part II: Graph Theoretical Algorithms -- Vertex Coloring -- Maximal Independent Sets -- Dominating Sets -- Matching -- Vertex Cover -- Part III: Ad Hoc Wireless Networks -- Introduction -- Topology Control -- Ad Hoc Routing -- Sensor Network Applications -- ASSIST: A Simulator to Develop Distributed Algorithms -- Pseudocode Conventions -- ASSIST Code -- Applications Using ASSIST. 330 $aGraph 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              . 410 0$aComputer Communications and Networks,$x1617-7975 606 $aAlgorithms 606 $aComputer communication systems 606 $aComputer science?Mathematics 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aMath Applications in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17044 615 0$aAlgorithms. 615 0$aComputer communication systems. 615 0$aComputer science?Mathematics. 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Communication Networks. 615 24$aMath Applications in Computer Science. 676 $a004.36 700 $aErciyes$b Kayhan$4aut$4http://id.loc.gov/vocabulary/relators/aut$01059880 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910741142203321 996 $aDistributed Graph Algorithms for Computer Networks$93553620 997 $aUNINA