Combinatorial Network Theory
By: edited by Ding-Zhu Du, D. Frank Hsu
Contributors: Hsu, D. Frank
Series: Applied Optimization -- 1; Applied optimization -- 1.
Publisher: Springer US
Published: 1996
Place of publication: Boston, MA
Language: eng
Format: [electronic resource] /
Number of pages: 213
ISBN-13: 9781441947529; 9781475724912
Subjects: Mathematics; Computational complexity; Combinatorial analysis; Algebra
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.