---

＜電子ブック＞
Combinatorial Network Theory / edited by Ding-Zhu Du, F. Hsu
(Applied Optimization ; 1)

版	1st ed. 1996.
出版者	(New York, NY : Springer US : Imprint: Springer)
出版年	1996
本文言語	英語
大きさ	VIII, 214 p : online resource
著者標目	Ding-Zhu Du editor Hsu, F editor SpringerLink (Online service)
件　名	LCSH:Discrete mathematics LCSH:Computer science -- Mathematics  全ての件名で検索 LCSH:Algebra, Homological FREE:Discrete Mathematics FREE:Mathematical Applications in Computer Science FREE:Discrete Mathematics in Computer Science FREE:Category Theory, Homological Algebra
一般注記	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) 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 HTTP:URL=https://doi.org/10.1007/978-1-4757-2491-2

 類似資料