Combinatorial Network Theory

F. Hsu

ISBN 10: 0792337778 / ISBN 13: 9780792337775

Edité par Springer US Dez 1995, 1995

A propos de cet article

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 228 pp. Englisch.

N° de réf. du vendeur 9780792337775

Détails bibliographiques

• Titre: Combinatorial Network Theory
• Éditeur: Springer US Dez 1995
• Date de parution: 1995
• Langue: anglais
• ISBN à 10 chiffres: 0792337778
• ISBN à 13 chiffres: 9780792337775
• Reliure: Buch
• État de l'article: Neu

A propos de ce titre

Synopsis

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.