Welcome to Central Library, SUST

Distributed Graph Algorithms for Computer Networks (Record no. 43762)

MARC details
000 -LEADER
fixed length control field 04060nam a22004937a 4500
001 - CONTROL NUMBER
control field sulb-eb0021670
003 - CONTROL NUMBER IDENTIFIER
control field BD-SySUS
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20160413122154.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 130517s2013 xxk| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781447151739
-- 978-1-4471-5173-9
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-1-4471-5173-9
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
Subject category code COM051300
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Erciyes, K.
Relator term author.
245 10 - TITLE STATEMENT
Title Distributed Graph Algorithms for Computer Networks
Medium [electronic resource] /
Statement of responsibility, etc. by K. Erciyes.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture London :
Name of producer, publisher, distributor, manufacturer Springer London :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2013.
300 ## - PHYSICAL DESCRIPTION
Extent XVIII, 324 p.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Computer Communications and Networks,
International Standard Serial Number 1617-7975
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Introduction -- 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.
520 ## - SUMMARY, ETC.
Summary, etc. 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              .
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Computer communication systems.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Computer Communication Networks.
Topical term or geographic name as entry element Math Applications in Computer Science.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9781447151722
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Computer Communications and Networks,
International Standard Serial Number 1617-7975
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="http://dx.doi.org/10.1007/978-1-4471-5173-9">http://dx.doi.org/10.1007/978-1-4471-5173-9</a>
912 ## -
-- ZDB-2-SCS
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type

No items available.