Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
>
Search Refine
Catalogue Card Display
Catalogue Card Display
RAK
Title: Combinatorial Network Theory ([EBook] /) / edited by Ding-Zhu Du, D. Frank Hsu. Dewey Class: 511.1 Added Personal Name: Du, Ding-Zhu. editor. Hsu, D. Frank. editor. Publication: Boston, MA : : Springer US : : Imprint: Springer,, 1996. Other name(s): SpringerLink (Online service) Physical Details: VIII, 214 p. : online resource. Series: Applied Optimization,1384-6485 ;; 1 ISBN: 9781475724912 System details note: Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users) Summary Note: A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.: Contents note: 1 Additive Group Theory Applied to Network Topology -- 2 Connectivity of Cayley Digraphs -- 3 De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations -- 4 Link-Connectivities of Extended Double Loop Networks -- 5 Dissemination of Information In Interconnection Networks (Broadcasting & Gossiping). ------------------------------ *** There are no holdings for this record *** -----------------------------------------------
Quick Search
Search for